Abstract
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/ε.
This research was done while the author was associated with the MPI Saarbrücken and was supported partially by the EU ESPRIT LTR Project No. 20244 (ALCOMIT) and by the Swiss Office Fédéral de l'éducation et de la Science project n 97.0315 titled ”Platform”.
Preview
Unable to display preview. Download preview PDF.
References
B.S. Baker and E.G. Coffman, Mutual exclusion scheduling, Theoretical Computer Science, 162 (1996) 225–243.
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.
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.
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.
U. Feige and J. Kilian, Zero Knowledge and the chromatic number, Conference on Computational Complexity, CCC 96, 278–287.
W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorial, 1 (1981) 349–355.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London, 1980.
S. Irani, Coloring inductive graphs on-line, Algorithmica, 11 (1994) 53–72.
S. Irani and V. Leung, Scheduling with conflicts, and applications to traffic signal control, Symposium on Discrete Algorithms, SODA 96, 85–94.
S. Irani, private communication.
K. Jansen and S. öhring, Approximation algorithms for time constrained scheduling, Information and Computation, 132 (1997) 85–108.
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.
D. Kaller, A. Gupta and T. Shermer: The χt — coloring problem, Symposium on Theoretical Aspects of Computer Science, STACS 95, LNCS 900, 409–420.
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.
Z. Lonc: On complexity of some chain and antichain partition problem, Graph Theoretical Concepts in Computer Science, WG 91, LNCS 570, 97–104.
D. de Werra, An introduction to timetabling, European Journal of Operations Research, 19 (1985) 151–162.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, K. (1998). An approximation scheme for bin packing with conflicts. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054353
Download citation
DOI: https://doi.org/10.1007/BFb0054353
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64682-2
Online ISBN: 978-3-540-69106-8
eBook Packages: Springer Book Archive