Bin packing can be solved within 1 + ε in linear time

Combinatorica

Volumn 1, Issue 4, 1981, Pages 349-355

  Fernandez de la Vega, W ^a   Lueker, G S ^b  

^a CNRS   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

AMS subject classification (1980): 68C25, 68E05, 90C10

Indexed keywords

EID: 51249181640     PISSN: 02099683     EISSN: 14396912     Source Type: Journal    
DOI: 10.1007/BF02579456     Document Type: Article

References (17)

1. Time bounds for selection
2. Multiprocessor scheduling as generalized bin-packing
3. Fast algorithms for bin packing
4. Worst case bounds for simple one-dimensional packing algorithms
5. Reducibility among combinatorial problems
6. Finding the median
7. New algorithms for bin packing
8. Probabilistic analysis of algorithms
9. A linear programming approach to the cutting-stock problem
10. Fast approximation algorithms for the knapsack and sum of subset problems
11. Mathematical methods of organizing and planning production
12. General techniques for combinatorial approximation