Journal of Parallel and Distributed Computing
Approximation algorithms for time constrained scheduling
Information and Computation
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Packing 2-Dimensional Bins in Harmony
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On a Constrained Bin-packing Problem
On a Constrained Bin-packing Problem
Approximation schemes for multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
An approximation algorithm for square packing
Operations Research Letters
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2,..., n} with sides s1, s2,..., sn ∈ [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 = θ) and the graph coloring problem (in which si = 0 for all i = 1, 2,..., n). 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+ε-approximation for bipartite graphs, which is almost best possible (unless P = NP). For perfect graphs, we design a 3.2744- approximation.