Skip to content

Implementation: Exact algorithms Dynamic programming (DYN) Exhaustive search, i.e. the generation of the entire search tree + some pruning. (EXH) Approximation algorithms Greedy 2-approximation algorithm (GREEDY) FPTAS

Notifications You must be signed in to change notification settings

gordana14/subset-sum-problem

Repository files navigation

subset-sum-problem

Implementation of the following algorithms: Exact algorithms: Dynamic programming (DYN) Exhaustive search, i.e. the generation of the entire search tree + some pruning. (EXH) Approximation algorithms: Greedy 2-approximation algorithm (GREEDY) FPTAS

About

Implementation: Exact algorithms Dynamic programming (DYN) Exhaustive search, i.e. the generation of the entire search tree + some pruning. (EXH) Approximation algorithms Greedy 2-approximation algorithm (GREEDY) FPTAS

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages