An Approximation Scheme for Bin Packing with Conflicts

Journal of Combinatorial Optimization

Volumn 3, Issue 4, 1999, Pages 363-377

  Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation scheme; Bin packing; Constant treewidth; Inductive graphs; Planar graphs

Indexed keywords

EID: 0042545045     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009871302966     Document Type: Article

References (16)

1. B.S. Baker and E.G. Coffman, "Mutual exclusion scheduling," Theoretical Computer Science, vol. 162, pp. 225-243, 1996.
2. P. Bjorstad, W.M. Coughran, and E. Grosse, "Parallel domain decomposition applied to coupled transport equations," in Domain Decomposition Methods in Scientific and Engineering Computing, D.E. Keys and J. Xu (Eds.), AMS, Providence, 1995, pp. 369-380.
3. H.L. Bodlaender and K. Jansen, "On the complexity of scheduling incompatible jobs with unit-times," in Mathematical Foundations of Computer Science, MFCS 93, LNCS 711, 1993, pp. 291-300.
4. E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, "Approximation algorithms for bin-packing - a survey," in Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum (Ed.), PWS Publishing, 1995, pp. 49-106.
5. U. Feige and J. Kilian, "Zero Knowledge and the Chromatic Number," in Conference on Computational Complexity, CCC 96, 1996, pp. 278-287.
6. W. Fernandez de la Vega and G.S. Lueker, "Bin packing can be solved within 1+∈ in linear time,∈ Combinatorica, vol. 1, pp. 349-355, 1981.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, 1979.
8. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press: London, 1980.
9. S. Irani, "Coloring inductive graphs on-line," Algorithmica, vol. 11, pp. 53-72, 1994.
10. S. Irani and V. Leung, "Scheduling with conflicts, and applications to traffic signal control," in Symposium on Discrete Algorithms, SODA 96, 1996, pp. 85-94.
11. K. Jansen and S. Öhring, "Approximation algorithms for time constrained scheduling," Information and Computation, vol. 132, pp. 85-108, 1997.
12. K. Jansen, "The mutual exclusion scheduling problem for permutation and comparability graphs," in Symposium on Theoretical Aspects of Computer Science, STAGS 98, LNCS 1373, 1998, pp. 287-297.
13. χt-coloring problem," in Symposium on Theoretical Aspects of Computer Science, STACS 95, LNCS 900, 1995, pp. 409-420.
14. N. Karmarkar and R.M. Karp, An efficient approximation scheme for the one-dimensional bin packing problem, in Symposium on the Foundations of Computer Science, FOCS 82, 1982, pp. 312-320.
15. Z. Lone, "On complexity of some chain and antichain partition problem," in Graph Theoretical Concepts in Computer Science, WG 91, LNCS 570, 1991, pp. 97-104.
16. D. de Werra, "An introduction to timetabling," European Journal of Operations Research, vol. 19, pp. 151-162, 1985.