On Multidimensional Packing Problems
Work
Year: 2004
Type: article
Abstract: We study the approximability of multidimensional generalizations of three classical packing problems: multiprocessor scheduling, bin packing, and the knapsack problem. Specifically, we study the vecto... more
Source: SIAM Journal on Computing
Authors Chandra Chekuri, Sanjeev Khanna
Institutions Alcatel Lucent (Germany), University of Pennsylvania
Cites: 29
Cited by: 204
Related to: 10
FWCI: 12.47
Citation percentile (by year/subfield): 99.98
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green