{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:31:43Z","timestamp":1743114703898,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_56","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"764-771","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Xiaosong","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"56_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","volume":"159","author":"B Bresar","year":"2011","unstructured":"Bresar, B., Kardos, F., Katrenic, J., Semanisin, G.: Minimum $$k$$-path vertex cover. Discrete Appl. Math. 159, 1189\u20131195 (2011)","journal-title":"Discrete Appl. Math."},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"T Dinur","year":"2005","unstructured":"Dinur, T., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162, 439\u2013485 (2005)","journal-title":"Ann. Math."},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"7009","DOI":"10.1016\/j.tcs.2011.09.009","volume":"412","author":"F Kardos\u0306","year":"2011","unstructured":"Kardos\u0306, F., Katrenic\u0306, J., Schiermeyer, I.: On computing the minimum 3-path vertex cover and dissociation number of graphs. Theor. Comput. Sci. 412, 7009\u20137017 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"56_CR5","doi-asserted-by":"publisher","unstructured":"Li, Y., Tu, J.: A 2-approximation algorithm for the vertex cover $$P_4$$ problem in cubic graphs. Int. J. Comput. Math. (published online, 2014). doi:10.1080\/00207160.2014.881476","DOI":"10.1080\/00207160.2014.881476"},{"key":"56_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-642-12368-9_8","volume-title":"Information Security Theory and Practices","author":"M Novotn\u00fd","year":"2010","unstructured":"Novotn\u00fd, M.: Design and analysis of a generalized canvas protocol. In: Samarati, P., Tunstall, M., Posegga, J., Markantonakis, K., Sauveron, D. (eds.) WISTP 2010. LNCS, vol. 6033, pp. 106\u2013121. Springer, Heidelberg (2010)"},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10898-011-9831-x","volume":"56","author":"X Liu","year":"2008","unstructured":"Liu, X., Lu, H., Wang, W., Wu, W.: PTAS for the minimum $$k$$-path connected vertex cover problem in unit disk graphs. J. Glob. Optim. 56, 449\u2013458 (2008)","journal-title":"J. Glob. Optim."},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ipl.2013.04.002","volume":"113","author":"J Tu","year":"2013","unstructured":"Tu, J., Yang, F.: The vertex cover $$P_{3}$$ problem in cubic graphs. Inf. Process. Lett. 113, 481\u2013485 (2013)","journal-title":"Inf. Process. Lett."},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.ipl.2011.04.009","volume":"111","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A factor 2 approximation algorithm for the vertex cover $$P_{3}$$ problem. Inf. Process. Lett. 111, 683\u2013686 (2011)","journal-title":"Inf. Process. Lett."},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","volume":"412","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A primal-dual approximation algorithm for the vertex cover $$P_{3}$$ problem. Theoret. Comput. Sci. 412, 7044\u20137048 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR11","unstructured":"Wu, B., Chao, K.: A note on eccentricities, diameters and radii (2004). www.csie.ntu.edu.tw\/kmchao\/tree04spr\/diameter.pdf"},{"key":"56_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2014.03.026","volume":"535","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Shi, Y., Zhang, Z.: Approximation algorithm for the minimum weight connected $$k$$-subgraph cover problem. Theoret. Comput. Sci. 535, 54\u201358 (2014)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T00:39:54Z","timestamp":1674175194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}