{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:29:11Z","timestamp":1762032551870},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_69","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"685-692","source":"Crossref","is-referenced-by-count":1,"title":["Computing Optimal Solutions for the min 3-set covering Problem"],"prefix":"10.1007","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. W\u0153ginger","year":"2003","unstructured":"W\u0153ginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"69_CR2","unstructured":"Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proc. Symposium on Discrete Algorithms, SODA, pp. 329\u2013337 (2001)"},{"key":"#cr-split#-69_CR3.1","doi-asserted-by":"crossref","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: domination????? a case study. Reports in Informatics 294, Department of Informatics, University of Bergen (2005);","DOI":"10.1007\/11523468_16"},{"key":"#cr-split#-69_CR3.2","unstructured":"Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.??3580, pp. 191???203. Springer, Heidelberg (2005)"},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"Grandoni, F.: A note on the complexity of minimum dominating set. J. Discr. Algorithms (2005) (to appear)","DOI":"10.1016\/j.jda.2005.03.002"},{"key":"69_CR5","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)"},{"key":"69_CR6","series-title":"A guide to the theory of NP-completeness","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)"},{"key":"69_CR7","unstructured":"Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA, pp. 856\u2013857 (1999)"},{"key":"69_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K","volume":"35","author":"J. Chen","year":"2000","unstructured":"Chen, J., Liu, L., Jia, W.: Improvement on vertex cover for low-degree graphs. Networks\u00a035, 253\u2013259 (2000)","journal-title":"Networks"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J.\u00a0Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"J.\u00a0Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T22:20:38Z","timestamp":1626819638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11602613_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}