{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:52Z","timestamp":1759638352042,"version":"3.35.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1016\/j.ipl.2008.09.021","type":"journal-article","created":{"date-parts":[[2008,9,25]],"date-time":"2008-09-25T08:18:54Z","timestamp":1222330734000},"page":"155-160","source":"Crossref","is-referenced-by-count":25,"title":["Approximating minimum independent dominating sets in wireless networks"],"prefix":"10.1016","volume":"109","author":[{"given":"Johann L.","family":"Hurink","sequence":"first","affiliation":[]},{"given":"Tim","family":"Nieberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.ipl.2008.09.021_bib001","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","article-title":"Unit disk graph recognition is NP-hard","volume":"9","author":"Breu","year":"1998","journal-title":"Computational Geometry. Theory and Applications"},{"issue":"2","key":"10.1016\/j.ipl.2008.09.021_bib002","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","article-title":"Polynomial-time approximation schemes for packing and piercing fat objects","volume":"46","author":"Chan","year":"2003","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ipl.2008.09.021_bib003","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/net.10097","article-title":"A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks","volume":"42","author":"Cheng","year":"2003","journal-title":"Networks"},{"key":"10.1016\/j.ipl.2008.09.021_bib004","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disks graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ipl.2008.09.021_bib005","unstructured":"P. Crescenzi, V. Kann (Eds.), A compendium of NP optimization problems, http:\/\/www.nada.kth.se\/~viggo\/problemlist\/"},{"issue":"6","key":"10.1016\/j.ipl.2008.09.021_bib006","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1137\/S0097539702402676","article-title":"Polynomial-time approximation schemes for geometric intersection graphs","volume":"34","author":"Erlebach","year":"2005","journal-title":"SIAM Journal of Computing"},{"author":"EYES","key":"10.1016\/j.ipl.2008.09.021_bib007"},{"key":"10.1016\/j.ipl.2008.09.021_bib008","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","article-title":"Approximating the minimum maximal independence number","volume":"46","author":"Halldorson","year":"1993","journal-title":"Information Processing Letters"},{"issue":"2","key":"10.1016\/j.ipl.2008.09.021_bib009","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1997.0903","article-title":"NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs","volume":"26","author":"Hunt","year":"1998","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ipl.2008.09.021_bib010","doi-asserted-by":"crossref","unstructured":"J. Kratochvil, Intersection graphs of noncrossing arc-connected sets in the plane, in: Proc. Symp. on Graph Drawing (GD'96), 1997, pp. 257\u2013270","DOI":"10.1007\/3-540-62495-3_53"},{"key":"10.1016\/j.ipl.2008.09.021_bib011","doi-asserted-by":"crossref","unstructured":"F. Kuhn, R. Wattenhofer, A. Zollinger, Ad-hoc networks beyond unit disk graphs, in: Proc. 1st ACM DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003","DOI":"10.1145\/941079.941089"},{"key":"10.1016\/j.ipl.2008.09.021_bib012","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/wcm.107","article-title":"Algorithmic, geometric and graphs issues in wireless networks","volume":"3","author":"Li","year":"2003","journal-title":"Wireless Communications and Mobile Computing"},{"key":"10.1016\/j.ipl.2008.09.021_bib013","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","article-title":"Simple heuristics for unit disk graphs","volume":"25","author":"Marathe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/j.ipl.2008.09.021_bib014","doi-asserted-by":"crossref","unstructured":"T. Nieberg, J.L. Hurink, Wireless communication graphs, in: Proc. Intelligent Sensors, Sensor Networks and Information Processing Conference, 2004, pp. 367\u2013372","DOI":"10.1109\/ISSNIP.2004.1417490"},{"key":"10.1016\/j.ipl.2008.09.021_bib015","series-title":"Proc. 3rd Workshop on Approximation and Online Algorithms","first-page":"296","article-title":"A PTAS for the minimum dominating set problem in unit disk graphs","volume":"vol. 3879","author":"Nieberg","year":"2005"},{"key":"10.1016\/j.ipl.2008.09.021_bib016","series-title":"Proc. 30th Workshop on Graph Theoretic Concepts in Computer Science","first-page":"214","article-title":"A robust PTAS for maximum independent sets in unit disk graphs","volume":"vol. 3353","author":"Nieberg","year":"2004"},{"issue":"1","key":"10.1016\/j.ipl.2008.09.021_bib017","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0196-6774(03)00048-8","article-title":"Robust algorithms for restricted domains","volume":"48","author":"Raghavan","year":"2003","journal-title":"Journal of Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019008002895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019008002895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T02:24:30Z","timestamp":1738376670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019008002895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["S0020019008002895"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2008.09.021","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}