Budgeted maximum graph coverage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2573 LNCS, Issue , 2002, Pages 321-332

  Krumke, Sven Oliver ^b   Marathe, Madhav V ^c   Poensgen, Diana ^b   Ravi, S S ^d   Wirth, Hans Christoph ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

^d State University of New York   (United States)

Author keywords

Approximation algorithm; Budgeted maximum coverage; Integer linear programming; Maximum weight matching; Treewidth

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; STARS; ALGORITHMS; POLYNOMIALS;

CONNECTED SUBGRAPHS; INTEGER LINEAR PROGRAMMING; MAXIMUM COVERAGE; MAXIMUM GRAPHS; MAXIMUM WEIGHT MATCHING; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TREE-WIDTH;

BUDGET CONTROL;

EID: 84901439991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_28     Document Type: Conference Paper

References (11)

1. A. A. Ageev and M. I. Sviridenko Approximation algorithms for maximum coverage and max cut with given sizes of parts Proceedings of 7th Conference on Integer Programming and Combinatorial Optimization (IPCO'99), Lecture Notes in Computer Science, vol. 1610, 1999, pp. 17-30.
2. A. A. Ageev and M. I. Sviridenko Pipage rounding: a new method of constructing algorithms with proven performance guarantee Preliminary version appeared as [1], to appear, 2002.
3. H. L. Bodlaender A tourist guide through tree width Tech. Report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1992.
4. M. R. Garey and D. S. Johnson Computers and intractability (a guide to the theory of NP-completeness) W.H. Freeman and Company, New York, 1979.
5. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns Parallel approximation schemes for a class of planar and near planar combinatorial problems Information and Computation (2002).
6. D. Hochbaum Approximation covering and packing problems in [7], 1997.
7. D. S. Hochbaum (ed.) Approximation algorithms for NP-hard problems PWS Publishing Company, Boston, 1997.
8. S. Khuller, A. Moss, and J. Naor The budgeted maximum coverage problem Information Processing Letters 70 (1999), 39-45.
9. S. O. Krumke, H. Noltemeier, H.-C. Wirth, and A. Ziegler Budgeted maximum coverage on paths in preparation, 2002.
10. C. H. Papadimitriou and K. Steiglitz Combinatorial optimization Prentice-Hall, Inc., 1982.
11. R. E. Stearns and H. B. Hunt III An algebraic model for combinatorial problems SIAM Journal on Computing 25 (1996), no. 2, 448-476.