An efficient fully polynomial approximation scheme for the Subset-Sum Problem

@article{Kellerer2003AnEF,
  title={An efficient fully polynomial approximation scheme for the Subset-Sum Problem},
  author={Hans Kellerer and Renata Mansini and Ulrich Pferschy and Maria Grazia Speranza},
  journal={J. Comput. Syst. Sci.},
  year={2003},
  volume={66},
  pages={349-370}
}
A new fully polynomial time approximation scheme for the interval subset sum problem
TLDR
This paper shows that the interval subset sum problem is relatively easy to solve compared to the 0–1 knapsack problem, and identifies several subclasses of the ISSP which are polynomial time solvable (with high probability), albeit the problem is generally NP-hard.
A FPTAS for the Subset Sum Problem with Real Numbers
TLDR
This paper provides a polynomial algorithm which maximizes the distance to a fixed point over a certain convex set by intersecting the unit hypercube with two relevant half spaces and shows that in case the subset sum problem has a solution, this algorithm gives the correct maximum distance up to an arbitrary chosen precision.
Constant-Time Approximation Algorithms for the Knapsack Problem
TLDR
This paper gives a constant-time approximation algorithm for the knapsack problem using weighted sampling, with which it approximates the optimal profit with probability at least 2/3 up to error at most an e -fraction of the total profit.
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
TLDR
This work presents an improved enumeration scheme for SSP, and implements it as a complete and exact algorithm (EnumPlus) that solves SSP in expected O(nlogn) time when density, while the previously best density scope is c·n/(logn)2.
An Improved FPTAS for 0-1 Knapsack
TLDR
An improved algorithm for the 0-1 knapsack problem is presented, with only a (1/ε)1/4 gap from the quadratic conditional lower bound based on (min, +)-convolution, from a multi-level extension of Chan's number-theoretic construction, and a greedy lemma that reduces unnecessary computation spent on cheap items.
An Improved Enumeration Scheme for Subset Sum Problem
TLDR
This work presents an improved enumeration scheme for SSP, and implements it as a complete and exact algorithm (EnumPlus) that solves SSP in expected O(n log n) time when density d ≥ c · √ n/ log n, while the previously best density scope is d · c · n/(log n) 2.
Approximation Schemes for 0-1 Knapsack
TLDR
A simpler algorithm is presented which achieves the same result and is deterministic as the latest polynomial-time approximation scheme, and can actually lead to an improved time bound near O(n + (1/eps)^{12/5}), and still further improvements for small n.
Techniques for solving subset sum problems within a given tolerance
TLDR
Four techniques for solving the subset sum problem are proposed that were found to perform efficiently on large and small problems and can outperform other techniques currently proposed in the literature under certain conditions.
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
TLDR
The approximability of the generalization of the antenna problem to include several base stations for antennas is discussed, and in particular its APX-hardness already in the uncapacitated case is shown.
...
...

References

SHOWING 1-10 OF 17 REFERENCES
A Fast Approximation Algorithm For The Subset-Sum Problem
TLDR
A new fully polynomial approximation scheme for the subset-sum problem is presented, which yields better time and space complexity bounds, and also tends to improve the practicability of the procedure.
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
TLDR
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
TLDR
A fully polynomial time approximation scheme (FPTAS) is presented for the classical 0-1 knapsack problem, which considerably improves the necessary space requirements and reduces the running time.
Approximation Algorithms for Combinatorial Problems
TLDR
For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm.
Worst-case analysis of greedy algorithms for the subset-sum problem
TLDR
A polynomial approximation scheme is presented for the Subset-Sum Problem and it is proved that its worst-case performance dominates that of Johnson's well-known scheme.
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem
TLDR
A new algorithm with O(n log n) running time is presented thus improving upon the straightforward O( n2) time bound for the classical 0–1 knapsack problem.
Fast approximation algorithms for knapsack problems
  • E. Lawler
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, and also tend to improve the practicality of the procedures.
Linear Time Algorithms for Knapsack Problems with Bounded Weights
TLDR
It is proved that an optimal solution to the Knapsack Problem is balanced, and thus only balanced feasible solutions need to be enumerated in order to solve the problem to optimality.
A fully polynomial approximation algorithm for the 0-1 knapsack problem
...
...