http://www.cnr.it/ontology/cnr/individuo/prodotto/ID29911
Approximation Algorithms for a Hierarchically Structured Bin Packing (Articolo in rivista)
- Type
- Label
- Approximation Algorithms for a Hierarchically Structured Bin Packing (Articolo in rivista) (literal)
- Anno
- 2004-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1016/j.ipl.2003.12.001 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- B. Codenotti; G. De Marco; M. Leoncini; M. Montangero; M. Santini (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
- Note
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Titolo
- Approximation Algorithms for a Hierarchically Structured Bin Packing (literal)
- Abstract
- In this paper we study a variant of the bin packing problem in which the items to be packed are structured as the leaves of a tree. The problem is motivated by document organization and retrieval. We show that the problem is NP-hard and we give approximation algorithms for the general case and for the particular case in which all the items have the same size. (C) 2003 Elsevier B.V. All rights reserved. (literal)
- Prodotto di
- Autore CNR
Incoming links:
- Prodotto
- Autore CNR di
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi