Approximation algorithms for a hierarchically structured bin packing problem

DOI10.1016/j.ipl.2003.12.001zbMath1178.68675OpenAlexW2063852444MaRDI QIDQ1029084

Manuela Montangero, Bruno Codenotti, Mauro Leoncini, Massimo Santini, Gianluca De Marco

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.12.001

zbMATH Keywords

algorithmsapproximation algorithmsNP-hardnessbin packing

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items

Circular and radial design comparison of survivability in asymmetrical hierarchical networks ⋮ Comments on the hierarchically structured bin packing problem

Cites Work

• Graph Clustering and Minimum Cut Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item