Parameterized approximation scheme for the multiple knapsack problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 665-674

  Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PROFITABILITY;

APPROXIMATION SCHEME; BIN PACKING PROBLEM; DECISION VERSION; KNAPSACK PROBLEMS; MULTIPLE KNAPSACK PROBLEM; PARAMETERIZED; RUNNING TIME; TOTAL PROFITS;

COMBINATORIAL OPTIMIZATION;

EID: 70349115582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.73     Document Type: Conference Paper

References (19)

1. E. Balas and E. Zemel: An algorithm for large zero-one knapsack problems, Operations Research, 28 (1980), 1130-1154.
2. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan: Time bounds for selection, Journal of Computer and System Sciences, 7 (1973), 448-461.
3. C. Chekuri and S. Khanna, A PTAS for the multiple knapsack problem, Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 213-222.
4. C. Chekuri and S. Khanna: A polynomial time approximation scheme for the multiple knapsack problem, SIAM Journal on Computing, 35 (2006), 713-728.
5. F. Diedrich, K. Jansen, F. Pascual, and D. Trystram: Approximation algorithms for scheduling wit reservations, Proceedings of Conference on High Performance Computing, HiPC 2007, 297-307.
6. D. Dor and U. Zwick: Selecting the median, SIAM Journal on Computing, 28 (1999), 1722-1758.
7. R. Downey: Parametrized complexity for the skeptic, Proceedings of IEEE Conference on Computational Complexity, CCC 2003, 147-169.
8. M.R. Fellows: Blow-ups, win/win's, and crown rules: some new directions in FPT, Proceedings of Workshop on Graph Theoretical Concepts in Computer Science, WG 2003, LNCS 2880, 1-12.
9. M.D. Grigoriadis, L.G. Khachiyan, L. Porkolab and J. Villavicencio: Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, 41 (2001), 1081-1091. (Pubitemid 33357800)
10. C. Kenyon and E. Remila: Approximate strip packing, Mathematics of Operations Research, 25 (2000), 645-656.
11. H. Kelleren: A polynomial time approximation scheme for the multiple knapsack problem, Proceedings of Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1999, LNCS 1671, 51-62.
12. H. Kellerer, U. Pferschy, and D. Pisinger: Knapsack Problems, Springer Verlag, Berlin, 2004.
13. E.L. Lawler: Fast approximation algorithms for knap-sack problems, Mathematics of Operations Research, 4 (1979), 339-356.
14. J.K. Lenstra, D.B. Shmoys, and E. Tardos: Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, 24 (1990), 259-272.
15. S. Martello and P. Toth: Knapsack Problems: Algorithms and Computer Implementations, John Wiley and Sons, New York, 1990.
16. D. Marx: Parametrized complexity and approximation algorithms, The Computer Journal, 51 (2008), 60-78.
17. S.A. Plotkin, D.B. Shmoys, and E. Tardos: Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 20 (1995), 257-301.
18. M. Scharbrodt, A. Steger, and H. Weisser: Approximability of scheduling with fixed jobs, Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, 961-962.
19. D.B. Shmoys and E. Tardos: An approximation algorithm for the generalized assignment problem, Mathematical programming, Series A, 62 (1993), 461-474.