Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1207-1216

  Karger, David ^a   Onak, Krzysztof ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; BINS; CLUSTERING ALGORITHMS; POLYNOMIALS;

APPROXIMATION SCHEME; BIN PACKING PROBLEM; CLASS OF DISTRIBUTIONS; LINEAR-TIME ALGORITHMS; MULTIDIMENSIONAL BIN PACKING; OBLIVIOUS ALGORITHMS; PACKING PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES;

POLYNOMIAL APPROXIMATION;

EID: 84902084650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. N. Bansal, A. Caprara, and M. Sviridenko. Improved approximation algorithms for multidimensional bin packing problems. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006. To appear.
2. N. Bansal, J. R. Correa, C. Kenyon, and M. Sviridenko. Bin packing in multiple dimensions: Inapproximability results and approximation schemes. Mathematics of Operation Research, 31(1):31-49, 2006.
3. A. Caprara. Packing 2-dimensional bins in harmony. In Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pages 490-499, 2002.
4. C. Chekuri and S. Khanna. On multidimensional packing problems. SIAM Journal on Computing, 33(4):837-851, 2004.
5. E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston, MA, USA, July 1996.
6. M. E. Dyer and A. M. Frieze. The solution of some random NP-hard problems in polynomial expected time. Journal of Algorithms, 10(4):451-489, 1989.
7. W. Fernandez de la Vega and G. Lueker. Bin packing can be solved within 1+⋯ in linear time. Combinatorica, 1:349-355, 1981.
8. R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12:415-440, 1987.
9. N. Karmarkar and R.M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1982), pages 312-320, 1982.
10. R. M. Karp, M. Luby, and A. Marchetti-Spaccamela. A probabilistic analysis of multidimensional bin packing problems. In Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (STOC 1984), pages 289-298, 1984.
11. H. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538-548, 1983.
12. D. A. Spielman and S.-H. Teng. Smoothed analysis: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385-463, 2004.
13. G. J. Woeginger. There is no asymptotic PTAS for twodimensional vector packing. Information Processing Letters, 64(6):293-297, 1997.