A Fast Approximation Algorithm for the Subset-sum Problem
From MaRDI portal
Recommendations
- A Fast Approximation Algorithm For The Subset-Sum Problem
- A polynomial approximation scheme for the subset sum problem
- Two linear approximation algorithms for the subset-sum problem
- scientific article; zbMATH DE number 1104339
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
Cited in
(20)- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- The bounded subset sum problem is almost everywhere randomly decidable in O(n)
- Worst-case analysis of an approximation scheme for the subset-sum problem
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- A 3/4-approximation algorithm for multiple subset sum
- A faster FPTAS for the subset-sums ratio problem
- Two linear approximation algorithms for the subset-sum problem
- Constant time approximation scheme for largest well predicted subset
- Approximability of the Subset Sum Reconfiguration Problem
- The subset sum problem
- Techniques for solving subset sum problems within a given tolerance
- scientific article; zbMATH DE number 4149895 (Why is no real title available?)
- \(O((\log n)^{2})\) time online approximation schemes for bin packing and subset sum problems
- A Fast Approximation Algorithm For The Subset-Sum Problem
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem
- An exact algorithm for the subset sum problem
- Investigating volatility transmission across international equity markets using multivariate fractional models
- Subset-sum problems with different summands: Computation
This page was built for publication: A Fast Approximation Algorithm for the Subset-sum Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148101)
