Worst-case analysis of greedy algorithms for the subset-sum problem
From MaRDI portal
Cites work
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for combinatorial problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3694944 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Worst-Case Analysis of Heuristic Algorithms
Cited in
(12)- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- Worst-case analysis of an approximation scheme for the subset-sum problem
- A new enumeration scheme for the knapsack problem
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
- A polynomial approximation scheme for the subset sum problem
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- Two linear approximation algorithms for the subset-sum problem
- Average-case performance of rollout algorithms for knapsack problems
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Lower bounds and heuristic algorithms for the k_i-partitioning problem
This page was built for publication: Worst-case analysis of greedy algorithms for the subset-sum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3042877)
