Abstract
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . ,n} with sides \({s_1, s_2 \ldots ,s_n \in [0,1]}\) and a conflict graph G = (V, E). We seek to find a partition of the items into independent sets of G, where each independent set can be packed into a unit square bin, such that no two squares packed together in one bin overlap. The goal is to minimize the number of independent sets in the partition. This problem generalizes the square packing problem (in which we have \({E = \emptyset}\)) and the graph coloring problem (in which s i = 0 for all i = 1,2, . . . , sn). It is well known that coloring problems on general graphs are hard to approximate. Following previous work on the one-dimensional problem, we study the problem on specific graph classes, namely, bipartite graphs and perfect graphs. We design a \({2+\varepsilon}\) -approximation for bipartite graphs, which is almost best possible (unless P = NP). For perfect graphs, we design a 3.2744-approximation.
Similar content being viewed by others
References
Bansal, N., Correa, J., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions: inapproximability results and approximation schemes. Math. Oper. Res. 31(1), 31–49 (2006)
Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional packing. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms, pp. 189–196. ACM/SIAM, New York/Philadelphia (2004)
Caprara, A.: Packing 2-dimensional bins in harmony. In: Proceedings of 43rd Annual Symposium on Foundations of Computer Science, pp. 490–499 (2002)
Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods 3, 66–76 (1982)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (eds) Approximation algorithms, PWS Publishing Company, Boston (1997)
Correa, J., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings of the 15th ACM/SIAM Symposium on Discrete Algorithms, pp. 179–188. ACM/SIAM, New York/Philadelphia (2004)
Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147–177 (1998)
Epstein, L., Levin, A.: On bin packing with conflicts. In: Proceedings of the 4th Workshop on Approximation and online Algorithms (WAOA2006), pp. 160–173 (2006)
Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. In: Proceedings of of 15th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’04), pp. 207–216 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Heidelberg (1993)
Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23(2), 317–327 (1976)
Hujter, M., Tuza, Z.: Precoloring extension, III: Classes of perfect graphs. Comb. Probab. Comput. 5, 35–56 (1996)
Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discrete Math. 2(1), 68–72 (1989)
Jansen, K.: An approximation scheme for bin packing with conflicts. J. Comb. Optim. 3(4), 363–377 (1999)
Jansen, K., Öhring, S.: Approximation algorithms for time constrained scheduling. Inf. Comp. 132, 85–108 (1997)
Kenyon, C., Rémila, E.: A near optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25(4), 645–656 (2000)
Kohayakawa, Y., Miyazawa, F.K.: Prabhakar Raghavan, and Yoshiko Wakabayashi. Multidimensional cube packing. Algorithmica 40(3), 173–187 (2004)
Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. J. ACM 32(3), 562–572 (1985)
Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J. Parallel Distrib. Comput. 10, 271–275 (1990)
Marx, D.: Precoloring extension. http://www.cs.bme.hu/dmarx/prext.html
Marx, D.: Precoloring extension on chordal graphs. In: Graph Theory in Paris. Proceedings of a Conference in Memory of Claude Berge, Trends in Mathematics, pp. 255–270. Birkhäuser, Basel (2007)
McCloskey, B., Shankar, A.: Approaches to bin packing with clique-graph conflicts. Technical Report UCB/CSD-05-1378, EECS Department, University of California, Berkeley (2005)
Meir, A., Moser, L.: On packing of squares and cubes. J. Comb. Theory Ser. A 5, 126–134 (1968)
Oh, Y., Son, S.H.: On a constrained bin-packing problem. Technical Report CS-95-14, Department of Computer Science, University of Virginia (1995)
Schrijver, A.: Combinatorial optimization polyhedra and efficiency. Springer, Heidelberg (2003)
Seiden, S.S., van Stee, R.: New bounds for multi-dimensional packing. Algorithmica 36(3), 261–293 (2003)
Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton (1971)
van Stee, R.: An approximation algorithm for square packing. Oper. Res. Lett. 32(6), 535–539 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
An extended abstract version of this paper has appeared in Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT 2007), pp 288–299.
Rob van Stee was supported by the Alexander von Humboldt Foundation.
Rights and permissions
About this article
Cite this article
Epstein, L., Levin, A. & van Stee, R. Two-dimensional packing with conflicts. Acta Informatica 45, 155–175 (2008). https://doi.org/10.1007/s00236-007-0067-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-007-0067-7