Bin Packing with Colocations

Abstract : Motivated by an assignment problem arising in MapReduce computations, we investigate a generalization of the Bin Packing problem which we call Bin Packing with Colocations Problem. We are given a weigthed graph G = (V, E), where V represents the set of items with positive integer weights and E the set of related (to be colocated) items, and an integer q. The goal is to pack the items into a minimum number of bins so that (i) for each bin, the total weight of the items packed in this bin is at most q, and (ii) for each edge (i, j) ∈ E there is at least one bin containing both items i and j. We first point out that, when the graph is unweighted (i.e., all the items have equal weights), the problem is equivalent to the q-clique problem, and when furthermore the graph is a clique, optimal solutions are obtained from Covering Designs. We prove that the problem is strongly NP-hard even for paths and unweighted trees. Then, we propose approximation algorithms for particular families of graphs, including: a (3+ √ 5)-approximation algorithm for complete graphs (improving a previous ratio of 8), a 2-approximation algorithm for paths, a 5-approximation algorithm for trees, and an (1 + O(log q/q))-approximation algorithm for unweighted trees. For general graphs, we propose a 3 + 2mad(G)/2-approximation algorithm, where mad(G) is the maximum average degree of G. Finally, we show how to convert any approximation algorithm for Bin Packing (resp. Densest q-Subgraph) problem into an approximation algorithm for the problem on weighted (resp. unweighted) general graphs.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01435614
Contributor : David Coudert <>
Submitted on : Saturday, January 14, 2017 - 6:59:55 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Saturday, April 15, 2017 - 12:17:47 PM

File

revjcb.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, et al.. Bin Packing with Colocations. 14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩. ⟨hal-01435614⟩

Share

Metrics

Record views

829

Files downloads

115