{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T03:48:52Z","timestamp":1774583332456,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540310006","type":"print"},{"value":"9783540314684","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_31","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"351-361","source":"Crossref","is-referenced-by-count":19,"title":["Approximation Algorithms for Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Erik Jan","family":"van Leeuwen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J. Alber","year":"2003","unstructured":"Alber, J., Fiala, J.: Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. J. Algorithms\u00a052(2), 134\u2013151 (2003)","journal-title":"J. Algorithms"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-45995-2_52","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Alber","year":"2002","unstructured":"Alber, J., Niedermeier, R.: Improved Tree Decomposition Based Algorithms for Domination-like Problems. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 613\u2013628. Springer, Heidelberg (2002)"},{"key":"31_CR3","volume-title":"Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Creszenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability. Springer, Berlin (1999)"},{"issue":"1","key":"31_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. JACM\u00a041(1), 153\u2013180 (1994)","journal-title":"JACM"},{"key":"31_CR5","first-page":"39","volume":"58","author":"H.W. Becker","year":"1952","unstructured":"Becker, H.W.: Planar Rhyme Schemes. Bull. Am. Math. Soc.\u00a058, 39 (1952)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1\u20132","key":"31_CR6","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A Tourist Guide through Treewidth. Acta Cybernetica\u00a011(1\u20132), 1\u201322 (1993)","journal-title":"Acta Cybernetica"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"T.M. Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time Approximation Schemes for Packing and Piercing Fat Objects. J. Algorithms\u00a046, 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"issue":"4","key":"31_CR8","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.-Z.: A Polynomial-Time Approximation Scheme for the Minimum Connected Dominating Set in Ad Hoc Wireless Networks. Networks\u00a042(4), 202\u2013208 (2003)","journal-title":"Networks"},{"issue":"1\u20133","key":"31_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discr. Math.\u00a086(1\u20133), 165\u2013177 (1990)","journal-title":"Discr. Math."},{"key":"31_CR10","first-page":"590","volume-title":"SODA 2005","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M.: Bidimensionality: New Connections between FPT Algorithms and PTASs. In: SODA 2005, pp. 590\u2013601. SIAM, Philadelphia (2005)"},{"key":"31_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"31_CR12","first-page":"671","volume-title":"SODA 2001","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time Approximation Schemes for Geometric Graphs. In: SODA 2001, pp. 671\u2013679. SIAM, Philadelphia (2001)"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. JACM\u00a032(1), 130\u2013136 (1985)","journal-title":"JACM"},{"issue":"2","key":"31_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"D.B. Hunt III","year":"1998","unstructured":"Hunt III, D.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Discrete and Computational Geometry","author":"T. Matsui","year":"2000","unstructured":"Matsui, T.: Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 194\u2013200. Springer, Heidelberg (2000)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-30559-0_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Nieberg","year":"2004","unstructured":"Nieberg, T., Hurink, J.L., Kern, W.: A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 214\u2013221. Springer, Heidelberg (2004)"},{"key":"31_CR18","unstructured":"Nieberg, T., Hurink, J.L.: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs, Memorandum No. 1732, Dept. of Appl. Math., Univ. Twente, Enschede (2004)"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. I. Excluding a Forest. J. Comb. Th. B\u00a035, 39\u201361 (1983)","journal-title":"J. Comb. Th. B"},{"issue":"4","key":"31_CR20","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Disc. Math.\u00a010(4), 529\u2013550 (1997)","journal-title":"SIAM J. Disc. Math."},{"key":"31_CR21","unstructured":"van Leeuwen, E.J.: Optimization Problems on Mobile Ad Hoc Networks \u2013 Algorithms for Disk Graphs, Master\u2019s Thesis INF\/SCR-04-32, Inst. of Information and Computing Sciences, Utrecht Univ. (2004)"},{"key":"31_CR22","unstructured":"van Leeuwen, E.J.: Approximation Algorithms for Unit Disk Graphs, Technical Report UU-CS-2004-066, Inst. of Information and Computing Sciences, Utrecht Univ. (2004)"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: IEEE Infocom 2002, vol.\u00a03, pp. 1597\u20131604 (2002)","DOI":"10.1145\/513800.513820"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T10:36:31Z","timestamp":1586601391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11604686_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}