Abstract
We consider min set covering when the subsets are constrained to have maximum cardinality three. We propose an exact algorithm whose worst case complexity is bounded above by O *(1.4492n).
Research performed while the first author was in visit at the LAMSADE on a research position funded by the CNRS.
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.
References
Wœginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)
Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proc. Symposium on Discrete Algorithms, SODA, pp. 329–337 (2001)
Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: domination – a case study. Reports in Informatics 294, Department of Informatics, University of Bergen (2005); Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191–203. Springer, Heidelberg (2005)
Grandoni, F.: A note on the complexity of minimum dominating set. J. Discr. Algorithms (2005) (to appear)
Berge, C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)
Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA, pp. 856–857 (1999)
Chen, J., Liu, L., Jia, W.: Improvement on vertex cover for low-degree graphs. Networks 35, 253–259 (2000)
Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41, 280–301 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Della Croce, F., Paschos, V.T. (2005). Computing Optimal Solutions for the min 3-set covering Problem. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_69
Download citation
DOI: https://doi.org/10.1007/11602613_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)