{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:12:08Z","timestamp":1743138728210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_30","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"363-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reoptimization of Path Vertex Cover Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7341-2362","authenticated-orcid":false,"given":"Mehul","family":"Kumar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9177-0307","authenticated-orcid":false,"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994, pp. 326\u2013335 (1994). https:\/\/doi.org\/10.1145\/195058.195179","DOI":"10.1145\/195058.195179"},{"issue":"12","key":"30_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(12), 1189\u20131195 (2011). https:\/\/doi.org\/10.1016\/j.dam.2011.04.008","journal-title":"Discrete Appl. Math."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2014.05.042","volume":"177","author":"B Bresar","year":"2014","unstructured":"Bresar, B., Krivos-Bellus, R., Semanisin, G., Sparl, P.: On the weighted k-path vertex cover problem. Discrete Appl. Math. 177, 14\u201318 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.05.042","journal-title":"Discrete Appl. Math."},{"key":"30_CR4","unstructured":"Camby, E., Cardinal, J., Chapelle, M., Fiorini, S., Joret, G.: A primal-dual 3-approximation algorithm for hitting 4-vertex paths. In: 9th International Colloquium on Graph Theory and Combinatorics, ICGT, p. 61 (2014)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/9781848162778_0004","volume-title":"Computability in Context","author":"Giorgio Ausiello","year":"2011","unstructured":"Escoffier, B., Bonifaci, V., Ausiello, G.: Complexity and approximation in reoptimization, February 2011. https:\/\/doi.org\/10.1142\/9781848162778_0004"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Lee, E.: Partitioning a graph into small pieces with applications to path transversal. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pp. 1546\u20131558 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.101","DOI":"10.1137\/1.9781611974782.101"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-12368-9_8","volume-title":"Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices","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). https:\/\/doi.org\/10.1007\/978-3-642-12368-9_8"},{"issue":"50","key":"30_CR8","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 $$\\text{p}_{\\text{3}}$$ problem. Theor. Comput. Sci. 412(50), 7044\u20137048 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.09.013","journal-title":"Theor. Comput. Sci."},{"key":"30_CR9","unstructured":"Uehara, R.: NP-complete problems on a 3-connected cubic planar graph and their applications (1996)"},{"key":"30_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:07:04Z","timestamp":1709820424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}