Abstract
The set multicover (MC) problem is a natural extension of the set cover problem s.t. each element requires to be covered a prescribed number of times (instead of just once as in set cover). The k-set multicover (k-MC) problem is a variant in which every subset is of size at most k. Due to the multiple coverage requirement, two versions of MC have been studied; the one in which each subset can be chosen only once (constrained MC) and the other in which each subset can be chosen any number of times (unconstrained MC). For both versions the best approximation algorithm known so far is the classical greedy heuristic, whose performance ratio is H(k), where H(k)= ∑\(_{i=1}^{k}\) (1/i). It is no hard, however, to come up with a natural modification of the greedy algorithm such that the resulting performance is never worse, but could also be strictly better. This paper will verify that this is indeed the case by showing that such a modification leads to an improved performance ratio of H(k)–1/6 for both versions of k-MC.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 39–50. Springer, Heidelberg (2004)
Chvátal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233–235 (1979)
Cook, W.J.: On some aspects of totally dual integral systems, PH.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario (1983)
Cook, W., Pulleyblank, W.R.: Linear systems for constrained matching problems. Math. Oper. Res. 12, 97–120 (1987)
Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 7(4), 515–531 (1982)
Duh, R., Fürer, M.: Approximation of k-set cover by semi-local optimization. In: Proc. 29th Annual ACM Symp. Theory of Computing, pp. 256–264 (1997)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)
Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. 15th ACM Symp. Theory of Computing, pp. 448–456 (1983)
Goldschmidt, O., Hochbaum, D.S., Yu, G.: A modified greedy heuristic for the Set Covering problem with improved worst case bound. Inform. Process. Lett. 48, 305–310 (1993)
Halldórsson, M.M.: Approximating discrete collections via local improvements. In: Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms, pp. 160–169 (1995)
Halldórsson, M.M.: Approximating k-set cover and complementary graph coloring. In: Proc. IPCO, vol. V, pp. 118–131 (1996)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 256–278 (1974)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383–390 (1975)
Papadimitriou, C., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci. 43, 425–440 (1991)
Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28, 526–541 (1999)
Schrijver, A.: Combinatorial Optimization, vol. A. Springer, Berlin (2003)
Slavík, P.: A tight analysis of the greedy algorithm for set cover. J. Algorithms 25(2), 237–254 (1997)
Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujito, T., Kurahashi, H. (2006). A Better-Than-Greedy Algorithm for k-Set Multicover. In: Erlebach, T., Persinao, G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671411_14
Download citation
DOI: https://doi.org/10.1007/11671411_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32207-8
Online ISBN: 978-3-540-32208-5
eBook Packages: Computer ScienceComputer Science (R0)