{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:00:52Z","timestamp":1761861652933,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,28]],"date-time":"2018-03-28T00:00:00Z","timestamp":1522195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771013","11531011"],"award-info":[{"award-number":["11771013","11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502431"],"award-info":[{"award-number":["61502431"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10878-018-0283-9","type":"journal-article","created":{"date-parts":[[2018,3,28]],"date-time":"2018-03-28T11:20:56Z","timestamp":1522236056000},"page":"35-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network"],"prefix":"10.1007","volume":"36","author":[{"given":"Lina","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,28]]},"reference":[{"key":"283_CR1","unstructured":"Bj\u00f6rklund A, Husfeldt T, Kaski P, Koivisto AM. Narrow sieves for parameterized paths and packings, \n                    arXiv:1007.1161"},{"key":"283_CR2","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","volume":"159","author":"B Bre\u0161ar","year":"2011","unstructured":"Bre\u0161ar B, Kardo\u0161 F, Katreni\u010d J, Semani\u0161 G (2011) Minimum \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -path vertex cover. Discrete Appl Math 159:1189\u20131195","journal-title":"Discrete Appl Math"},{"key":"283_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.disopt.2015.11.003","volume":"19","author":"M Chang","year":"2016","unstructured":"Chang M, Chen L, Hung L, Rossmanith P, Su P (2016) Fixed-parameter algorithms for vertex cover \n                    \n                      \n                    \n                    $$P_3$$\n                    \n                      \n                        \n                          P\n                          3\n                        \n                      \n                    \n                  . Discrete Optim 19:12\u201322","journal-title":"Discrete Optim"},{"issue":"4","key":"283_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"Cheng X, Huang X, Li D, Wu W, Du D (2003) A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4):202\u2013208","journal-title":"Networks"},{"issue":"3","key":"283_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s11590-009-0148-3","volume":"4","author":"X Gao","year":"2010","unstructured":"Gao X, Wang W, Zhang Z, Zhu S, Wu W (2010) A PTAS for minimum \n                    \n                      \n                    \n                    $$d$$\n                    \n                      \n                        d\n                      \n                    \n                  -hop connected dominating set in growth-bounded graphs. Optim Lett 4(3):321\u2013333","journal-title":"Optim Lett"},{"key":"283_CR6","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J ACM 32:130\u2013136","journal-title":"J ACM"},{"key":"283_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.dam.2015.12.004","volume":"205","author":"X Li","year":"2016","unstructured":"Li X, Zhang Z, Huang X (2016) Approximation algorithms for minimum (weight) connected \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -path vertex cover. Discrete Appl Math 205:101\u2013108","journal-title":"Discrete Appl Math"},{"issue":"2","key":"283_CR8","doi-asserted-by":"publisher","first-page":"1250014","DOI":"10.1142\/S1793830912500140","volume":"4","author":"Q Liu","year":"2012","unstructured":"Liu Q, Li X, Wu L, Du H, Zhang Z, Wu W, Hu X, Xu Y (2012) A new proof for Zassenhaus\u2013Groemer\u2013Oler inequality. Discrete Math Algorithms Appl 4(2):1250014","journal-title":"Discrete Math Algorithms Appl"},{"key":"283_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10898-011-9831-x","volume":"56","author":"X Liu","year":"2013","unstructured":"Liu X, Lu H, Wang W, Wu W (2013) PTAS for the minimum \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -path connected vertex cover problem in unit disk graphs. J Glob Optim 56:449\u2013458","journal-title":"J Glob Optim"},{"key":"283_CR10","doi-asserted-by":"crossref","unstructured":"Novotny M (2010) Design and analysis of a generalized canvas protocol. In: Proceedings of WISTP 2010, in: LNCS 6033:106\u2013121","DOI":"10.1007\/978-3-642-12368-9_8"},{"key":"283_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02559533","volume":"105","author":"N Oler","year":"1961","unstructured":"Oler N (1961) An inequality in the geometry of numbers. Acta Math. 105:19\u201348","journal-title":"Acta Math."},{"key":"283_CR12","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 (2011) A factor 2 approximation algorithm for the vertex cover \n                    \n                      \n                    \n                    $$P_{3}$$\n                    \n                      \n                        \n                          P\n                          3\n                        \n                      \n                    \n                   problem. Inf. Process. Lett. 111:683\u2013686","journal-title":"Inf. Process. Lett."},{"key":"283_CR13","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 (2011) A primal-dual approximation algorithm for the vertex cover \n                    \n                      \n                    \n                    $$P_3$$\n                    \n                      \n                        \n                          P\n                          3\n                        \n                      \n                    \n                   problem. Theor Comput Sci 412:7044\u20137048","journal-title":"Theor Comput Sci"},{"issue":"2","key":"283_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S1793830909000221","volume":"1","author":"W Wang","year":"2009","unstructured":"Wang W, Kim D, Sohaee N, Ma C, Wu W (2009) A PTAS for minimum \n                    \n                      \n                    \n                    $$d$$\n                    \n                      \n                        d\n                      \n                    \n                  -hop underwater sink placement problem in 2-D underwater sensor networks. Discrete Math Algorithms Appl 1(2):283\u2013289","journal-title":"Discrete Math Algorithms Appl"},{"key":"283_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2015.01.005","volume":"571","author":"L Wang","year":"2015","unstructured":"Wang L, Zhang X, Zhang Z, Broersma H (2015) A PTAS for the minimum weight connected vertex cover \n                    \n                      \n                    \n                    $$P_3$$\n                    \n                      \n                        \n                          P\n                          3\n                        \n                      \n                    \n                   problem on unit disk graphs. Theor Comput Sci 571:58\u201366","journal-title":"Theor Comput Sci"},{"key":"283_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10878-015-9937-z","volume":"33","author":"L Wang","year":"2017","unstructured":"Wang L, Du W, Zhang Z, Zhang X (2017) A PTAS for minimum weighted connected vertex cover \n                    \n                      \n                    \n                    $$P_3$$\n                    \n                      \n                        \n                          P\n                          3\n                        \n                      \n                    \n                   problem in 3-dimensional wireless sensor networks. J Comb Optim 33:106\u2013122","journal-title":"J Comb Optim"},{"issue":"3","key":"283_CR17","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10898-008-9384-9","volume":"45","author":"Z Zhang","year":"2009","unstructured":"Zhang Z, Gao X, Wu W, Du D (2009) A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks. J Glob Optim 45(3):451\u2013458","journal-title":"J Glob Optim"},{"key":"283_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ipl.2016.11.003","volume":"119","author":"Z Zhang","year":"2017","unstructured":"Zhang Z, Li X, Shi Y, Nie H, Zhu Y (2017) PTAS for minimum \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -path vertex cover in ball graph. Inf Process Lett 119:9\u201313","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0283-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0283-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0283-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T20:18:42Z","timestamp":1553717922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0283-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,28]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0283-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,3,28]]},"assertion":[{"value":"28 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}