On bin packing with conflicts

SIAM Journal on Optimization

Volumn 19, Issue 3, 2008, Pages 1270-1298

  Epstein, Leah ^a   Levin, Asaf ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximation algorithms; Bin packing; Online algorithms

Indexed keywords

ASYMPTOTIC COMPETITIVE RATIO; BIN PACKING; BIN PACKING PROBLEM; BIPARTITE GRAPHS; CHORDAL GRAPHS; COLORING PROBLEMS; COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; CONFLICT GRAPH; GENERAL GRAPH; GRAPH CLASS; GRAPH COLORING PROBLEM; INDEPENDENT SET; INTERVAL GRAPH; LOWER BOUNDS; OFFLINE; ONE-DIMENSIONAL; ONLINE ALGORITHMS; ONLINE BIN PACKING; ONLINE PROBLEMS; ONLINE VERSIONS; OPTIMAL VALUES; PERFECT GRAPH; SPECIAL CLASS;

BINS; COLORING; CONTROL THEORY; GRAPH THEORY; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 69649095974     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/060666329     Document Type: Article

References (33)

1. E. Arkin and R. Hassin, On local search for weighted packing problems, Math. Oper. Res., 23 (1998), pp. 640-648.
2. B. S. Baker and E. G. Coffman, Jr., A tight asymptotic bound for Next-Fit-Decreasing bin-packing, SIAM J. Algebr. Discrete Methods, 2 (1981), pp. 147-152.
3. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, London, 1998.
4. P. Crescenzi, V. Kann, M. M. Halldórsson, M. Karpinski, and G. J. Woeginger, A Compendium of NP Optimization Problems, http://www.nada.kth.se/ ~viggo/problemlist/compendium.html.
5. J. Csirik and J. Y.-T. Leung, Variants of classical one-dimensional bin packing, in Handbook of Approximation Algorithms and Metaheuristics, T. F. Gonzalez, ed., Chapman & Hall/CRC, 2007, pp. (33-1) - (33-13).
6. D. de Werra, An introduction to timetabling, European J. Oper. Res., 19 (1985), pp. 151-162.
7. G. Even and S. Shahar, Scheduling of a smart antenna: Capacitated coloring of unit circulararc graphs, in Proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN2006), 2006, pp. 58-71.
8. G. Galambos and G. J. Woeginger, Repacking helps in bounded space online bin packing, Computing, 49 (1993), pp. 329-338.
9. M. R. Garey, R. L. Graham, D. S. Johnson, and A. C. 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, W. H. Freeman and Company, New York, 1979.
11. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
12. R. L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 263-269.
13. A. Gyárfás and J. Lehel, On-line and first fit colorings of graphs, J. Graph Theory, 12 (1988), pp. 217-227.
14. M. Hujter and Z. Tuza, Precoloring extension, III: Classes of perfect graphs, Combin. Probab. Comput., 5 (1996), pp. 35-56.
15. S. Irani and V. J. LEUNG, Scheduling with conflicts on bipartite and interval graphs, J. Sched., 6 (2003), pp. 287-307.
16. K. Jansen, An approximation scheme for bin packing with conflicts, J. Comb. Optim., 3 (1999), pp. 363-377.
17. K. Jansen and S. Öhring, Approximation algorithms for time constrained scheduling, Inform. and Comput., 132 (1997), pp. 85-108.
18. T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley, New York, 1995.
19. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 3 (1974), pp. 299-325.
20. H. A. Kierstead and W. T. Trotter, An extremal problem in recursive combinatorics, Congr. Numer., 33 (1981), pp. 143-153.
21. C. C. Lee and D. T. Lee, A simple online bin packing algorithm, J. ACM, 32 (1985), pp. 562-572.
22. L. Lovász, M. Saks, and W. T. Trotter, An on-line graph coloring algorithm with sublinear performance ratio, Discrete Math., 75 (1989), pp. 319-325.
23. D. Marx, Precoloring Extension, http://www.cs.bme.hu/~dmarx/prext.html.
24. D. Marx, Precoloring Extension on Chordal Graphs, manuscript, 2004.
25. B. McCloskey and A. Shankar, Approaches to Bin Packing with Clique-Graph Conflicts, Technical report UCB/CSD-05-1378, EECS Department, University of California, Berkeley, 2005.
26. Y. Oh and S. H. Son, On a Constrained Bin-packing Problem, Technical report CS-95-14, Department of Computer Science, University of Virginia, Charlottesville, VA, 1995.
27. A. Schrijver, Combinatorial Optimization Polyhedra and Efficiency, Springer-Verlag, Berlin, 2003.
28. S. S. Seiden, On the online bin packing problem, J. ACM, 49 (2002), pp. 640-671.
29. D. Simchi-Levi, New worst-case results for the bin-packing problem, Naval Res. Logist., 41 (1994), pp. 579-585.
30. N. J. A. Sloane, On-line Encyclopedia of Integer Sequences, 1996-2005, http://www.research. att.com/~njas/sequences/Seis.html.
31. J. D. Ullman, The performance of a Memory Allocation Algorithm, Technical report 100, Princeton University, Princeton, NJ, 1971.
32. A. VAN Vliet, An improved lower bound for online bin packing algorithms, Inform. Process. Lett., 43 (1992), pp. 277-284.
33. A. C. C. Yao, New algorithms for bin packing, J. ACM, 27 (1980), pp. 207-227.