A ( 1 − 1 / e )-approximation algorithm for the maximum generalized assignment problem with fixed profits
暂无分享,去创建一个
[1] Frits C. R. Spieksma,et al. Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems , 2003, IEEE Trans. Computers.
[2] Milind Dawande,et al. Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..
[3] Viggo Kann,et al. Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[6] Sanjeev Khanna,et al. A PTAS for the multiple knapsack problem , 2000, SODA '00.
[7] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[8] Frits C. R. Spieksma,et al. Approximation of a Retrieval Problem for Parallel Disks , 2003, CIAC.
[9] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[10] Jayant Kalagnanam,et al. A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints , 2006, INFORMS J. Comput..
[11] N. Alon,et al. The Probabilistic Method, Second Edition , 2000 .