Approximation algorithms for a hierarchically structured bin packing problem
type: Item
instance of: scholarly article
title: Approximation algorithms for a hierarchically structured bin packing problem
zbMATH Open document ID: 1178.68675
author: Bruno Codenotti
author: Mauro Leoncini
author: Manuela Montangero
author: Massimo Santini
author: Gianluca De Marco
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5576944
zbMATH Keywords: algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: bin packing
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.12.001
OpenAlex ID: W2063852444
cites work: Q3002852
cites work: Graph Clustering and Minimum Cut Trees
cites work: Q4198056
cites work: Q4290987
DOI: 10.1016/J.IPL.2003.12.001
Recommended article: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
Recommended article: Approximation algorithms for extensible bin packing
Recommended article: Comments on the hierarchically structured bin packing problem
Recommended article: Q3347319
Recommended article: A sublinear-time approximation scheme for bin packing
Recommended article: Q3538741
Recommended article: An Efficient Approximation Scheme for Variable-Sized Bin Packing
Recommended article: Approximation schemes for the generalized extensible bin packing problem
Recommended article: Parameterized approximation algorithms for packing problems
description: scientific article; zbMATH DE number 5576944