The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
DOI10.1007/BF02331572zbMATH Open0729.90063OpenAlexW2032162132MaRDI QIDQ3354469FDOQ3354469
Authors: K. H. Borgwardt, B. Tremel 
Publication date: 1991
Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02331572
Recommendations
- Stochastic analysis of greedy algorithms for the subset sum problem
- Two linear approximation algorithms for the subset-sum problem
- A class of generalized greedy algorithms for the multi-knapsack problem
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
- The bounded subset sum problem is almost everywhere randomly decidable in O(n)
knapsack problemssubset sum maximizationgreedy-algorithmsstochastic analysis of heuristic algorithms
Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Geometric algorithms and combinatorial optimization
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Solving low-density subset sum problems
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
- Largest-first sequential selection with a sum constraint
- Worst-case analysis of greedy algorithms for the subset-sum problem
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- Probabilistic analysis of the subset-sum problem
- The bounded subset sum problem is almost everywhere randomly decidable in O(n)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
- Bounds on the Performance of a Greedy Algorithm for Probabilities
- Largest-first sequential selection with a sum constraint
- Stochastic analysis of greedy algorithms for the subset sum problem
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
- Average-case performance of rollout algorithms for knapsack problems
This page was built for publication: The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3354469)
