{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:10Z","timestamp":1725497170659},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_20","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"202-213","source":"Crossref","is-referenced-by-count":5,"title":["Complexity and Approximation Results for the Connected Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci.\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"20_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"E.M. Arkin","year":"1993","unstructured":"Arkin, E.M., Halld\u00f3rsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Inf. Process. Lett.\u00a047(6), 275\u2013282 (1993)","journal-title":"Inf. Process. Lett."},{"key":"20_CR3","volume-title":"Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties)","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties). Springer, Berlin (1999)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Even, S.: On approximating a vertex cover for planar graphs. In: STOC, pp. 303\u2013309 (1982)","key":"20_CR5","DOI":"10.1145\/800070.802205"},{"issue":"1-2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial -arboretum of graphs with bounded treewidth. Theor. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A. Brandstadt","year":"1999","unstructured":"Brandstadt, A., Le, V.B., Spinrad, J.: Graph classes: a survey. Society for Industrial and Applied Mathematic, Philadelphia (1999)"},{"doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: LICS, pp. 411\u2013420 (2006)","key":"20_CR8","DOI":"10.1109\/LICS.2006.13"},{"unstructured":"Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality: new connections between fpt algorithms and ptass. In: SODA, pp. 590\u2013601 (2005)","key":"20_CR9"},{"unstructured":"Fernau, H., Manlove, D.: Vertex and edge covers with clustering properties: Complexity and algorithms. In: Algorithms and Complexity in Durham, pp. 69\u201384 (2006)","key":"20_CR10"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/11786986_38","volume-title":"Automata, Languages and Programming","author":"T. Fujito","year":"2006","unstructured":"Fujito, T.: How to trim an mst: A 2-approximation algorithm for minimum cost tree cover. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 431\u2013442. Springer, Heidelberg (2006)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem in NP complete. SIAM Journal of Applied Mathematics\u00a032, 826\u2013834 (1977)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"20_CR13","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/11534273_5","volume-title":"Algorithms and Data Structures","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 36\u201348. Springer, Heidelberg (2005)"},{"key":"20_CR15","first-page":"379","volume-title":"IEEE Conference on Computational Complexity","author":"S. Khot","year":"2003","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03b5. In: IEEE Conference on Computational Complexity, pp. 379\u2013386. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00453-003-1071-0","volume":"38","author":"J. K\u00f6nemann","year":"2003","unstructured":"K\u00f6nemann, J., Konjevod, G., Parekh, O., Sinha, A.: Improved approximations for tour and tree covers. Algorithmica\u00a038(3), 441\u2013449 (2003)","journal-title":"Algorithmica"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11753728_28","volume-title":"Computer Science \u2013 Theory and Applications","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 270\u2013280. Springer, Heidelberg (2006)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11809678_29","volume-title":"Computing and Combinatorics","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: Enumerate and expand: New runtime bounds for vertex cover variants. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 265\u2013273. Springer, Heidelberg (2006)"},{"unstructured":"Moser, H.: Exact algorithms for generalizations of vertex cover. Master\u2019s thesis, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena (2005)","key":"20_CR19"},{"issue":"5","key":"20_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","volume":"14","author":"C.D. Savage","year":"1982","unstructured":"Savage, C.D.: Depth-first search and the vertex cover problem. Inf. Process. Lett.\u00a014(5), 233\u2013237 (1982)","journal-title":"Inf. Process. Lett."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S. Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discrete Mathematics\u00a072, 355\u2013360 (1988)","journal-title":"Discrete Mathematics"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1109\/ISCAS.1991.176537","volume-title":"IEEE International Sympoisum on Circuits and Systems","author":"T. Wanatabe","year":"1991","unstructured":"Wanatabe, T., Kajita, S., Onaga, K.: Vertex covers and connected vertex covers in 3-connected graphs. In: IEEE International Sympoisum on Circuits and Systems, pp. 1017\u20131020. IEEE Computer Society Press, Los Alamitos (1991)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:32Z","timestamp":1619520152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_20","relation":{},"subject":[]}}