{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:19:34Z","timestamp":1725499174841},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540446248"},{"type":"electronic","value":"9783540446279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_27","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T05:25:39Z","timestamp":1159939539000},"page":"385-398","source":"Crossref","is-referenced-by-count":7,"title":["Distributed Approximation Algorithms in Unit-Disk Graphs"],"prefix":"10.1007","author":[{"given":"A.","family":"Czygrinow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ha\u0144\u0107kowiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network Decomposition and Locality in Distributed Computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364\u2013369 (1989)","key":"27_CR1","DOI":"10.1109\/SFCS.1989.63504"},{"issue":"4","key":"27_CR2","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.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks\u00a042(4), 202\u2013208 (2003)","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed algorithms for weighted problems in sparse graphs. Journal of Discrete Algorithms (in press, 2006)","key":"27_CR3","DOI":"10.1016\/j.jda.2005.07.006"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11758471_29","volume-title":"Algorithms and Complexity","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Szyma\u0144ska, E.: Distributed approximation algorithms for planar graphs. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998. Springer, Heidelberg (2006)"},{"key":"27_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, New York (1997)"},{"issue":"10","key":"27_CR6","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TPDS.2004.48","volume":"15","author":"F. Dai","year":"2004","unstructured":"Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Transactions on Parallel and Distributed Systems\u00a015(10), 908\u2013920 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"unstructured":"Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 717\u2013724 (2003)","key":"27_CR7"},{"doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Discrete mobile centers. In: Proc of the 17th annual Symposium on Computational Geometry (SCG), pp. 188\u2013196 (2001)","key":"27_CR8","DOI":"10.1145\/378583.378666"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the Locality of Bounded Growth. In: 24th ACM Symposium on the Principles of Distributed Computing (PODC), Las Vegas, Nevada, USA, pp. 60\u201368 (2005)","key":"27_CR9","DOI":"10.1145\/1073814.1073826"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11561927_21","volume-title":"Distributed Computing","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 273\u2013287. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local Approximation Schemes for Ad Hoc and Sensor Networks. In: 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Cologne, Germany, pp. 97\u2013103 (2005)","key":"27_CR11","DOI":"10.1145\/1080810.1080827"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1998","unstructured":"Lichtenstein, D.: Planar Formulae and Their Uses. SIAM Journal of Computing\u00a011(2), 329\u2013343 (1998)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11671411_23","volume-title":"Approximation and Online Algorithms","author":"T. Nieberg","year":"2006","unstructured":"Nieberg, T., Hurink, J.L.: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 296\u2013306. Springer, Heidelberg (2006)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/PL00008932","volume":"14","author":"A. Panconesi","year":"2001","unstructured":"Panconesi, A., Rizzi, R.: Some Simple Distributed Algorithms for Sparse Networks. Distributed Computing\u00a014, 97\u2013100 (2001)","journal-title":"Distributed Computing"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:24Z","timestamp":1619508084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11864219_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}