{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T21:07:54Z","timestamp":1767474474723,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,9,2]],"date-time":"2005-09-02T00:00:00Z","timestamp":1125619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,9,2]]},"DOI":"10.1145\/1080810.1080827","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"97-103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Local approximation schemes for ad hoc and sensor networks"],"prefix":"10.1145","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Tim","family":"Nieberg","sequence":"additional","affiliation":[{"name":"Universiteit Twente, The Netherlands"}]},{"given":"Thomas","family":"Moscibroda","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Rogert","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2005,9,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073978"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/513800.513820"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796337"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00014-X"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062689.1062693"},{"key":"e_1_3_2_1_11_1","first-page":"671","volume-title":"Proc. 12th {ACM}-{SIAM} symposium on discrete algorithms (SODA}'01","author":"Erlebach T.","year":"2001","unstructured":"T. Erlebach , K. Jansen , and E. Seidel . Polynomial-time approximation schemes for geometric graphs . In Proc. 12th {ACM}-{SIAM} symposium on discrete algorithms (SODA}'01 , pages 671 -- 679 , Washington, DC, 7--9 2001 . T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proc. 12th {ACM}-{SIAM} symposium on discrete algorithms (SODA}'01, pages 671--679, Washington, DC, 7--9 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_37"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0903"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/820264.820485"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"e_1_3_2_1_16_1","first-page":"33","volume-title":"Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC)","author":"Jia L.","year":"2001","unstructured":"L. Jia , R. Rajaraman , and R. Suel . An Efficient Distributed Algorithm for Constructing Small Dominating Sets . In Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC) , pages 33 -- 42 , 2001 . L. Jia, R. Rajaraman, and R. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 33--42, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1023720.1023746"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073826"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_21"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022630.1022634"},{"key":"e_1_3_2_1_23_1","volume-title":"The Price of Being Near-Sighted. preprint","author":"Kuhn F.","year":"2005","unstructured":"F. Kuhn , T. Moscibroda , and R. Wattenhofer . The Price of Being Near-Sighted. preprint , 2005 . F. Kuhn, T. Moscibroda, and R. Wattenhofer. The Price of Being Near-Sighted. preprint, 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872040"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/941079.941089"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250205"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073842"},{"key":"e_1_3_2_1_28_1","volume-title":"Sensor Networks and Information Processing Conference (ISSNIP)","author":"Nieberg T.","year":"2004","unstructured":"T. Nieberg and J. Hurink . Wireless communication graphs. In Intelligent Sensors , Sensor Networks and Information Processing Conference (ISSNIP) , 2004 . T. Nieberg and J. Hurink. Wireless communication graphs. In Intelligent Sensors, Sensor Networks and Information Processing Conference (ISSNIP), 2004."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_23"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30559-0_18"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958513"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/144179.144283"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916674"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. INFOCOM","author":"Wan P.","year":"2002","unstructured":"P. Wan , K. Alzoubi , and O. Frieder . Distributed construction of connected dominating set in wireless ad hoc networks . In Proc. INFOCOM , 2002 . P. Wan, K. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In Proc. INFOCOM, 2002."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062689.1062692"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/313239.313261"}],"event":{"name":"Dial M - POMC 05: Joint Workshop on Foundations of Mobile Computing 2005","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Cologne Germany","acronym":"Dial M - POMC 05"},"container-title":["Proceedings of the 2005 joint workshop on Foundations of mobile computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1080810.1080827","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1080810.1080827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:42Z","timestamp":1750263522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1080810.1080827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,2]]},"references-count":36,"alternative-id":["10.1145\/1080810.1080827","10.1145\/1080810"],"URL":"https:\/\/doi.org\/10.1145\/1080810.1080827","relation":{},"subject":[],"published":{"date-parts":[[2005,9,2]]},"assertion":[{"value":"2005-09-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}