Bin Packing with Colocations

DOI10.1007/978-3-319-51741-4_4zbMath1484.68329OpenAlexW2569793901MaRDI QIDQ2971155

Dimitrios Letsios, Stéphane Pérennes, David Coudert, Jean-Claude Bermond, Ioannis Milis, Nathann Cohen, Vassilios Zissimopoulos

Publication date: 4 April 2017

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01381333v2/file/REV150318.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination ⋮ Bin Packing with Colocations ⋮ Improved budgeted connected domination and budgeted edge-vertex domination

Cites Work

• Unnamed Item
• On a packing and covering problem
• On the degrees of the vertices of a directed graph
• Detecting high log-densities
• Bin Packing with Colocations
• Approximation Algorithms for the k-Clique Covering Problem

This page was built for publication: Bin Packing with Colocations