Bin packing can be solved within 1 + ε in linear time
- 1 December 1981
- journal article
- Published by Springer Science and Business Media LLC in Combinatorica
- Vol. 1 (4), 349-355
- https://doi.org/10.1007/bf02579456
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- General Techniques for Combinatorial ApproximationOperations Research, 1977
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Finding the medianJournal of Computer and System Sciences, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961
- Mathematical Methods of Organizing and Planning ProductionManagement Science, 1960