A Fast Approximation Algorithm For The Subset-Sum Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1104339
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- A Fast Approximation Algorithm for the Subset-sum Problem
- Parallel approximation schemes for subset sum and knapsack problems
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
Cites work
- scientific article; zbMATH DE number 3644795 (Why is no real title available?)
- 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 linear time randomizing algorithm for searching ranked functions
- A new saling algorithm for the maximum mean cut problem
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
- Approximate binary search algorithms for mean cuts and cycles
- Fast Approximation Algorithms for Knapsack Problems
- Fast approximation algorithm for job sequencing with deadlines
- New scaling algorithms for the assignment and minimum mean cycle problems
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
Cited in
(32)- Approximability of the Subset Sum Reconfiguration Problem
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- On different approximation criteria for subset product problems
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Subset-sum problems with different summands: Computation
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- An exact algorithm for the subset sum problem
- Worst-case analysis of an approximation scheme for the subset-sum problem
- A 3/4-approximation algorithm for multiple subset sum
- Subset sum problems with special digraph constraints
- Solutions for subset sum problems with special digraph constraints
- \(O((\log n)^{2})\) time online approximation schemes for bin packing and subset sum problems
- A Fast Approximation Algorithm for the Subset-sum Problem
- Choosing Subsets with Maximum Weighted Average
- Space-efficient approximations for subset sum
- Constant time approximation scheme for largest well predicted subset
- A subquadratic approximation scheme for partition
- A faster FPTAS for the subset-sums ratio problem
- Techniques for solving subset sum problems within a given tolerance
- Saving space by algebraization
- A new fully polynomial time approximation scheme for the interval subset sum problem
- The subset sum problem
- Approximability of the subset sum reconfiguration problem
- A polynomial approximation scheme for the subset sum problem
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- Parallel approximation schemes for subset sum and knapsack problems
- Two linear approximation algorithms for the subset-sum problem
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- An optimization algorithm for the clearing of interbank payments
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- The bounded subset sum problem is almost everywhere randomly decidable in O(n)
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 Q4313818)
