The knapsack problem with neighbour constraints

Journal of Discrete Algorithms

Volumn 16, Issue , 2012, Pages 224-235

  Borradaile, Glencora ^a   Heeringa, Brent ^b   Wilfong, Gordon ^c  

^a OREGON STATE UNIVERSITY   (United States)

^b WILLIAMS COLLEGE   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation algorithm; Knapsack

Indexed keywords

DEPENDENCY GRAPHS; HARDNESS RESULT; KNAPSACK; KNAPSACK PROBLEMS; PROFIT FUNCTION;

APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; PROFITABILITY;

COMBINATORIAL OPTIMIZATION;

EID: 84865459244     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2012.04.011     Document Type: Conference Paper

References (16)

1. N. Boland, C. Fricke, G. Froyland, R. Sotirov, Clique-based facets for the precedence constrained knapsack problem, Technical report, Tilburg University Repository, Netherlands, http://arno.uvt.nl/oai/wo.uvt.nl.cgi, 2005.
2. Uriel Feige A threshold of ln n for approximating set cover J. ACM 45 4 1998 634 652
3. Olivier Goldschmidt, David Nehme, and Gang Yu Note: On the set-union knapsack problem Naval Res. Logist. 41 6 1994 833 842
4. P.R. Goundan, A.S. Schulz, Revisiting the greedy approach to submodular set function maximization, Preprint, 2007.
5. M. Hajiaghayi, K. Jain, K. Konwar, L. Lau, The minimum k-colored subgraph problem in haplotyping and DNA primer selection, in: Proc. Int. Workshop on Bioinformatics Research and Applications, Jan. 2006.
6. E. Halperin, R. Krauthgamer, Polylogarithmic inapproximability, in: Proceedings of STOC, 2003, pp. 585-594.
7. Oscar H. Ibarra, and Chul E. Kim Fast approximation algorithms for the knapsack and sum of subset problems J. ACM 22 October 1975 463 468
8. D.S. Johnson, and K.A. Niemi On knapsacks, partitions, and a new dynamic programming technique for trees Math. Oper. Res. 8 1 1983 1 14
9. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack Problems 2004 Springer
10. Samir Khuller, Anna Moss, and Joseph (Seffi) Naor The budgeted maximum coverage problem Inform. Process. Lett. 70 1 1999 39 45
11. S.G. Kolliopoulos, and G. Steiner Partially ordered knapsack and applications to scheduling Discrete Appl. Math. 155 8 2007 889 897
12. Ariel Kulik, Hadas Shachnai, and Tami Tamir Maximizing submodular set functions subject to multiple linear constraints Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA09 2009 Society for Industrial and Applied Mathematics Philadelphia, PA, USA 545 554
13. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko Non-monotone submodular maximization under matroid and knapsack constraints Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC09 2009 ACM New York, NY, USA 323 332
14. S. Martello, and P. Toth Knapsack Problems: Algorithms and Computer Implementation 1990 John Wiley and Sons
15. Maxim Sviridenko A note on maximizing a submodular set function subject to a knapsack constraint Oper. Res. Lett. 32 1 2004 41 43
16. V. Vazirani Approximation Algorithms 2001 Springer-Verlag Berlin