{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:09:53Z","timestamp":1725516593903},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_24","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"255-264","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph"],"prefix":"10.1007","author":[{"given":"Zhao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Abu-Khzam, F.N., et al.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proc.6th Workshop on Algorithm Engineering and Experiments & 1st Workshop on Analytic Algorithmics and Combinatorics, pp. 62\u201369 (2004)","key":"24_CR1"},{"key":"24_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., Halldorsson, M.M., Hassin, R.: Approximating the Tree and Tour Covers of a Graph. Inform. Process. Lett.\u00a047, 275\u2013282 (1993)","journal-title":"Inform. Process. Lett."},{"key":"24_CR3","first-page":"27","volume":"25","author":"R. Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda, R., Even, S.: A local-ration Theorem for Approximating the Weighted Vertex Cover Problem, Analysis and Design of Algorithms for Combinatorial Problems. Annals of Discrete Mathematics\u00a025, 27\u201346 (1985)","journal-title":"Annals of Discrete Mathematics"},{"key":"24_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.: A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks\u00a042, 202\u2013208 (2003)","journal-title":"Networks"},{"issue":"6","key":"24_CR5","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput.\u00a034(6), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2004.01.011","volume":"90","author":"T. Fujito","year":"2004","unstructured":"Fujito, T., Doi, T.: A 2-Approximation NC Algorithm for Connected Vertex Cover and Tree Cover. Inform. Process. Lett.\u00a090, 59\u201363 (2004)","journal-title":"Inform. Process. Lett."},{"key":"24_CR7","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 is \n                  \n                    \n                  \n                  $\\mathcal{NP}$\n                -Complete. SIAM J. Appl. Math.\u00a032, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"24_CR8","volume-title":"Approximation Algorithm for $\\mathcal{NP}$ -hard Problems","author":"D.H. Hochbaum","year":"1996","unstructured":"Hochbaum, D.H.: Approximation Algorithm for \n                  \n                    \n                  \n                  $\\mathcal{NP}$\n                -hard Problems, PWS, Boston, MA (1996)"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-62495-3_53","volume-title":"Graph Drawing","author":"J. Kratochvil","year":"1997","unstructured":"Kratochvil, J.: Intersection graphs of noncrossing arc-connected sets in the plane. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 257\u2013270. Springer, Heidelberg (1997)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.jpdc.2005.10.007","volume":"66","author":"X.Y. Li","year":"2006","unstructured":"Li, X.Y., Wang, Y.: Simple Approximation Algorithms and PTASs for Various Problems in Wireless Ad-Hoc Networks. Journal of Parallel and Distributed Computing\u00a066, 515\u2013530 (2006)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00290149","volume":"22","author":"B. Monien","year":"1985","unstructured":"Monien, B., Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Informatica\u00a022, 115\u2013123 (1985)","journal-title":"Acta Informatica"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. J. Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"J. Computer and System Sciences"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","volume":"14","author":"C. Savage","year":"1982","unstructured":"Savage, C.: Depth-First Search and the Vertex Cover Problem. Inform. Process. Lett.\u00a014, 233\u2013235 (1982)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/(SICI)1097-0037(199612)28:4<187::AID-NET3>3.0.CO;2-H","volume":"28","author":"L.S. Wang","year":"1996","unstructured":"Wang, L.S., Jiang, T.: An approximation scheme for some Steiner tree problems in the plane. Networks\u00a028(4), 187\u2013193 (1996)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:01Z","timestamp":1619523661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}