A polynomial approximation scheme for the subset sum problem
From MaRDI portal
Recommendations
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- scientific article; zbMATH DE number 1104339
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Worst-case analysis of an approximation scheme for the subset-sum problem
- A Fast Approximation Algorithm For The Subset-Sum Problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
- An introduction to parallelism in combinatorial optimization
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
- Discrete-variable extremum problems
- Worst-case analysis of an approximation scheme for the subset-sum problem
- Worst-case analysis of greedy algorithms for the subset-sum problem
Cited in
(10)- scientific article; zbMATH DE number 27746 (Why is no real title available?)
- An exact algorithm for the subset sum problem
- A Fast Approximation Algorithm for the Subset-sum Problem
- Dynamic programming for the subset sum problem
- A Logarithmic Bound for Solving Subset Sum with P Systems
- Techniques for solving subset sum problems within a given tolerance
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Master-slave strategy and polynomial approximation
This page was built for publication: A polynomial approximation scheme for the subset sum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346700)
