An approximation scheme for bin packing with conflicts

  • Klaus Jansen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1432)


In this paper we consider the following bin packing problem with conflicts. Given a set of items V={1, ..., n} with sizes s1, ..., s n ∃ (0,1] and a conflict graph G=(V,E), we consider the problem to find a packing for the items into bins of size one such that adjacent items (j, j')E are assigned to different bins. The goal is to find an assignment with a minimum number of bins.

This problem is a natural generalization of the classical bin packing problem. We propose an asymptotic approximation scheme for the bin packing problem with conflicts restricted to d-inductive graphs with constant d. This graph class contains trees, grid graphs, planar graphs and graphs with constant treewidth. The algorithm finds an assignment for the items such that the generated number of bins is within a factor of (1 + ε) of optimal, and has a running time polynomial both in n and 1/ε.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B.S. Baker and E.G. Coffman, Mutual exclusion scheduling, Theoretical Computer Science, 162 (1996) 225–243.CrossRefMathSciNetGoogle Scholar
  2. 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 (eds. D.E. Keys, J. Xu), AMS, Providence, 1995, 369–380.Google Scholar
  3. 3.
    H.L. Bodlaender and K. Jansen, On the complexity of scheduling incompatible jobs with unit-times, Mathematical Foundations of Computer Science, MFCS 93, LNCS 711, 291–300.Google Scholar
  4. 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 (ed. D.S. Hochbaum), PWS Publishing, 1995, 49–106.Google Scholar
  5. 5.
    U. Feige and J. Kilian, Zero Knowledge and the chromatic number, Conference on Computational Complexity, CCC 96, 278–287.Google Scholar
  6. 6.
    W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorial, 1 (1981) 349–355.Google Scholar
  7. 7.
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.Google Scholar
  8. 8.
    M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London, 1980.Google Scholar
  9. 9.
    S. Irani, Coloring inductive graphs on-line, Algorithmica, 11 (1994) 53–72.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    S. Irani and V. Leung, Scheduling with conflicts, and applications to traffic signal control, Symposium on Discrete Algorithms, SODA 96, 85–94.Google Scholar
  11. 11.
    S. Irani, private communication.Google Scholar
  12. 12.
    K. Jansen and S. öhring, Approximation algorithms for time constrained scheduling, Information and Computation, 132 (1997) 85–108.CrossRefMathSciNetGoogle Scholar
  13. 13.
    K. Jansen, The mutual exclusion scheduling problem for permutation and comparability graphs, Symposium on Theoretical Aspects of Computer Science, STACS 98, LNCS 1373, 1998, 287–297.MathSciNetGoogle Scholar
  14. 14.
    D. Kaller, A. Gupta and T. Shermer: The χt — coloring problem, Symposium on Theoretical Aspects of Computer Science, STACS 95, LNCS 900, 409–420.Google Scholar
  15. 15.
    N. Karmarkar and R.M. Karp, An efficient approximation scheme for the one-dimensional bin packing problem, Symposium on the Foundations of Computer Science, FOCS 82, 312–320.Google Scholar
  16. 16.
    Z. Lonc: On complexity of some chain and antichain partition problem, Graph Theoretical Concepts in Computer Science, WG 91, LNCS 570, 97–104.Google Scholar
  17. 17.
    D. de Werra, An introduction to timetabling, European Journal of Operations Research, 19 (1985) 151–162.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Klaus Jansen
    • 1
  1. 1.IDSIALuganoSwitzerland

Personalised recommendations