On multidimensional packing problems

SIAM Journal on Computing

Volumn 33, Issue 4, 2004, Pages 837-851

  Chekuri, Chandra ^a   Khanna, Sanjeev ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Approximation algorithms; Bin packing; Combinatorial optimization; Hardness of approximation; Knapsack; Multidimensional packing; Multiprocessor scheduling; Packing integer programs; Vector bin packing; Vector scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; BIN PACKING; COMBINATORIAL OPTIMIZATION (CO); HARDNESS OF APPROXIMATION; KNAPSACK; MULTIDIMENSIONAL PACKING; MULTIPROCESSOR SCHEDULING; PACKING INTEGER PROGRAMS; VECTOR BIN PACKING; VECTOR SCHEDULING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SET THEORY; VECTORS;

MULTIPROCESSING SYSTEMS;

EID: 4544371857     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799356265     Document Type: Article

References (31)

1. N. ALON, Y. AZAR, J. CSIRIK, L. EPSTEIN, S. V. SEVASTIANOV, A. P. A. VESTJENS, AND G. J. WOEGINGER, On-line and off-line approximation algorithms for vector covering problems, Algorithmica, 21 (1998), pp. 104-118.
2. S. F. ASSMAN, Problems in Discrete Applied Mathematics, Ph.D. thesis, Mathematics Department, Massachusetts Institute of Technology, Cambridge, MA, 1983.
3. C. CHEKURI AND S. KHANNA, On multi-dimensional packing problems, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1999, pp. 185-194.
4. D. J. DEWITT AND J. GRAY, Parallel database systems: The future of high performance database systems, Comm. ACM, 35 (1992), pp. 85-98.
5. U. FEIGE AND J. KILIAN, Zero knowledge and the chromatic number, J. Comput. System Sci., 57 (1998), pp. 187-199.
6. W. FERNANDEZ DE LA VEGA AND G. S. LUEKER, Bin packing can be solved within 1 + ∈ in linear time, Combinatorica, 1 (1981), pp. 349-355.
7. A. M. FRIEZE AND M. R. B. CLARKE, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, European J. Oper. Res., 15 (1984), pp. 100-109.
8. M. R. GAREY AND R. L. GRAHAM, Bounds for multiprocessor scheduling with resource constraints, SIAM J. Comput., 4 (1975), pp. 187-200.
9. M. R. GAREY, R. L. GRAHAM, D. S. JOHNSON, AND A. C. YAO, Resource constrained scheduling as generalized bin packing, J. Combin. Theory Ser. A, 21 (1976), pp. 257-298.
10. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
11. M. N. GAROFALAKIS AND Y. E. IOANNIDIS, Scheduling issues in multimedia query optimization, ACM Computing Surveys, 27 (1995), pp. 590-592.
12. M. N. GAROFALAKIS AND Y. E. IOANNIDIS, Multi-dimensional resource scheduling for parallel queries, in Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996, pp. 365-376.
13. M. N. GAROFALAKIS AND Y. E. IOANNIDIS, Parallel query scheduling and optimization with time-and space-shared resources, in Proceedings of the 23rd International Conference on Very Large Data Bases, Morgan Kaufmann, San Francisco, 1997, pp. 296-305.
14. M. N. GAROFALAKIS, B. ÖZDEN, AND A. SILBERSCHATZ, Resource scheduling in enhanced payper-view continuous media databases, in Proceedings of the 23rd International Conference on Very Large Data Bases, Morgan Kaufmann, San Francisco, 1997, pp. 516-525.
15. R. L. GRAHAM, Bounds for certain multiprocessor anomalies, Bell System Tech. J., 45 (1966), pp. 1563-1581.
16. R. L. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
17. M. M. HALLDÓRSSON, Approximating k-set cover and complementary graph coloring, in Proceedings of the Fifth IPCO Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1084, Springer-Verlag, Berlin, 1996, pp. 118-131.
18. 1-∈, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA. 1996, pp. 627-636.
19. D. S. HOCHBAUM AND D. B. SHMOYS, Using dual approximation algorithms for scheduling problems: Theoretical and practical results, J. ACM, 34 (1987), pp. 144-162.
20. O. H. IBARRA AND C. E. KIM, Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22 (1975), pp. 463-468.
21. N. KARMARKAR AND R. KARP, An efficient approximation scheme for the one-dimensional bin-packing problem, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 312-320.
22. R. M. KARP, M. LUBY, AND A. MARCHETTI-SPACCAMELA, A probabilistic analysis of multi-dimensional bin packing problems, in Proceedings of the Annual ACM Symposium on the Theory of Computing, 1984, pp. 289-298.
23. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, Sequencing and scheduling: Algorithms and complexity, in Handbooks in Operations Research and Management Science, Vol. 4, Elsevier Science, Amsterdam, 1993, pp. 445-522.
24. L. LOVÁSZ, On the ratio of the optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
25. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
26. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
27. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987). pp. 365-374.
28. A. SCHHIJVER, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, Wiley, Chichester, UK, 1986.
29. A. SRINIVASAN, Improved approximations of packing and covering problems, in Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995, pp. 268-276.
30. G. WOEGINGER, A polynomial time approximation scheme for maximizing the minimum completion time, Oper. Res. Lett., 20 (1997), pp. 149-154.
31. G. WOEGINGER, There is no asymptotic PTAS for two-dimensional vector packing, Inform. Process. Lett., 64 (1997), pp. 293-97.