Approximation algorithms for a hierarchically structured bin packing problem

Information Processing Letters

Volumn 89, Issue 5, 2004, Pages 215-221

  Codenotti, Bruno ^a,d   De Marco, Gianluca ^b   Leoncini, Mauro ^b,c   Montangero, Manuela ^b   Santini, Massimo ^b,c  

^a The University of Iowa   (United States)

^b Istituto di Informatica e Telematica   (Italy)

^c UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^d IIT CNR   (Italy)

Author keywords

Algorithms; Approximation algorithms; Bin packing; NP hardness

Indexed keywords

APPROXIMATION ALGORITHMS; BIN PACKING; NP-HARDNESS;

ALGORITHMS; APPROXIMATION THEORY; BINS; COMPUTATIONAL METHODS; DATA PROCESSING; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

INFORMATION RETRIEVAL;

EID: 0742269468     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.12.001     Document Type: Article

References (9)

1. Chakrabarti S., Dom B., Agrawal R., Raghavan P. Scalable feature selection, classification and signature generation for organizing large text databases into hierarchical topic taxonomies. VLDB J. 7:1998;163-178.
2. Coffman E.G. Jr., Garey M.R., Johnson D.S. Approximation algorithms for bin packing: a survey. Hochbaum D. Approximation Algorithms for NP-hard Problems. 1996;46-93 PWS Publishing, Boston.
3. Crescenzi P., Kann V. A compendium of NP optimization problems. http://www.nada.kth.se/theory/problemlist.html.
4. Dhillon I.S., Fan J., Guan Y. Efficient clustering of very large document collections. Grossman R., Kamath G., Naburu R. Data Mining for Scientific and Engineering Applications. 2001;357-382 Kluwer Academic Publishers, Dordrecht.
5. G.W. Flake, K. Tsioutsiouliklis, R.E. Tarjan, Graph clustering techniques based on minimum cut trees, Technical Report 2002-06, NEC, Princeton, NJ, 2002.
6. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman Company, San Francisco.
7. Karmarkar N., Karp R.M. An efficient approximation scheme for the one-dimensional bin packing problem. Proc. 23rd Annual IEEE Symp. on Foundations of Computer Science. 1982;312-320.
8. Simchi-Levi D. New worst case results for the bin packing problem. Naval Res. Logistics. 41:1994;579-585.
9. Viles C.L., French J.C. Dissemination of collection wide information in a distributed information retrieval system. Proc. 18th Annual Internat. ACM Conf. on Research and Development in Information Retrieval (SIGIR). 1995;12-20.