Abstract
An instance of the maximum coverage problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements. We formulate the problem on graphs: In this situation the set of ground elements is speci.ed by the nodes of a graph, while the family of covering sets is restricted to connected subgraphs. We show that on general graphs the problem is polynomial time solvable if restricted to sets of size at most 2, but becomes NP-hard if sets of size 3 are permitted. On trees, we prove polynomial time solvability if each node appears in a fixed number of sets. In contrast, if vertices are allowed to appear an unbounded number of times, the problem is NP-hard even on stars. We finally give a polynomial time algorithm for the special case where a star is covered by paths.
Research supported by the German Science Foundation (DFG, grant GR 883/10)
Research supported by NSF Grant CCR-97-34936
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
H. L. Bodlaender A tourist guide through treewidth · Tech. Report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1992.
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.
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).
D. Hochbaum · Approximation covering and packing problems · in [7], 1997.
D. S. Hochbaum (ed.) · Approximation algorithms for NP-hard problems· PWS Publishing Company, Boston, 1997.
S. Khuller, A. Moss, and J. Naor · The budgeted maximum coverage problem · Information Processing Letters 70 (1999), 39–45.
S. O. Krumke, H. Noltemeier, H.-C. Wirth, and A. Ziegler · Budgeted maximum coverage on paths · in preparation, 2002.
C. H. Papadimitriou and K. Steiglitz · Combinatorial optimization · Prentice-Hall, Inc., 1982.
R. E. Stearns and H. B. Hunt III · An algebraic model for combinatorial problems · SIAM Journal on Computing 25 (1996), no. 2, 448–476.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumke, S.O., Marathe, M.V., Poensgen, D., Ravi, S., Wirth, HC. (2002). Budgeted Maximum Graph Coverage. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_28
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive