Approximation schemes for the subset-sum problem: Survey and experimental analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3694944 (Why is no real title available?)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- Approximation algorithms for combinatorial problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Hard Knapsack Problems
- Probabilistic analysis of the subset-sum problem
- Worst-case analysis of greedy algorithms for the subset-sum problem
Cited in
(11)- Approximability of the Subset Sum Reconfiguration Problem
- LATIN 2004: Theoretical Informatics
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
- Worst-case analysis of an approximation scheme for the subset-sum problem
- Heuristic methods and applications: A categorized survey
- A new fully polynomial time approximation scheme for the interval subset sum problem
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
- A Fast Approximation Algorithm For The Subset-Sum Problem
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
This page was built for publication: Approximation schemes for the subset-sum problem: Survey and experimental analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069445)
