论文信息 - A (1-1/e)-approximation algorithm for the generalized assignment problem

A (1-1/e)-approximation algorithm for the generalized assignment problem

We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 12.

[1] Frits C. R. Spieksma,et al. Approximation of a Retrieval Problem for Parallel Disks , 2003, CIAC.

[2] Viggo Kann,et al. Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[3] Jayant Kalagnanam,et al. A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints , 2006, INFORMS J. Comput..

[4] N. Alon,et al. The Probabilistic Method, Second Edition , 2000 .

[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Sanjeev Khanna,et al. A PTAS for the multiple knapsack problem , 2000, SODA '00.

[9] Milind Dawande,et al. Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..

[10] Frits C. R. Spieksma,et al. Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems , 2003, IEEE Trans. Computers.

[11] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..