{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T09:10:09Z","timestamp":1739178609664,"version":"3.37.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00446-009-0083-7","type":"journal-article","created":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T13:52:46Z","timestamp":1245851566000},"page":"15-28","source":"Crossref","is-referenced-by-count":1,"title":["Distributed construction of low-interference spanners"],"prefix":"10.1007","volume":"22","author":[{"given":"Mirela","family":"Damian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nagesh","family":"Javali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,25]]},"reference":[{"key":"83_CR1","doi-asserted-by":"crossref","unstructured":"Meyer auf de Heide, F., Schindelhauer, C., Volbert, K., Gr\u00fcnewald, M.: Energy, congestion and dilation in radio networks. In: SPAA \u201902: Proceedings of the Fourteenth Annual ACM symposium on Parallel Algorithms and Architectures, pp. 230\u2013237. ACM, New York (2002)","DOI":"10.1145\/564870.564910"},{"key":"83_CR2","unstructured":"Burkhart, M.: Analysis of interference in ad-hoc networks. Diploma Thesis, 2003. Swiss Federal Institute of Technology Zurich"},{"key":"83_CR3","doi-asserted-by":"crossref","unstructured":"Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: MobiHoc \u201904: 5th ACM International Symposium of Mobile Ad Hoc Networking and Computing, pp. 9\u201319, 2004","DOI":"10.1145\/989459.989462"},{"issue":"2","key":"83_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00454-004-1121-7","volume":"32","author":"A. Czumaj","year":"2004","unstructured":"Czumaj A., Zhao H.: Fault-tolerant geometric spanners. Discrete Comput. Geom. 32(2), 207\u2013230 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"83_CR5","doi-asserted-by":"crossref","unstructured":"Damian, M., Pandit, S., Pemmaraju, S.V.: Local approximation schemes for topology control. In: PODC\u201906: Proceedings of the 25th ACM Symposium on the Principles of Distributed Computing, pp. 208\u2013218, July 2006. An extended version of the PODC paper with a few typos fixed is available at http:\/\/arXiv.org\/abs\/0803.2174","DOI":"10.1145\/1146381.1146413"},{"issue":"4","key":"83_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S0218195997000193","volume":"7","author":"G. Das","year":"1997","unstructured":"Das G., Narasimhan G.: A fast algorithm for constructing sparse Euclidean spanners. Int. J. Comput. Geom. Appl. 7(4), 297\u2013315 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"83_CR7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"Eppstein D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J.(eds) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier, Amsterdam (2000)"},{"key":"83_CR8","volume-title":"Handbook on Approximation Algorithms and Metaheuristics","author":"J. Gudmundsson","year":"2006","unstructured":"Gudmundsson J., Knauer C.: Dilation and detours in geometric networks. In: Gonzalez, T.F.(eds) Handbook on Approximation Algorithms and Metaheuristics, Chapman & Hall\/CRC, Boca Raton (2006)"},{"issue":"4","key":"83_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s004460100054","volume":"14","author":"Y. Hassin","year":"2001","unstructured":"Hassin Y., Peleg D.: Sparse communication networks and efficient routing in the plane. Distrib. Comput. 14(4), 205\u2013215 (2001)","journal-title":"Distrib. Comput."},{"key":"83_CR10","doi-asserted-by":"crossref","unstructured":"Johansson, T., Carr-Moty\u010dkov\u00e1, L.: Reducing interference in ad hoc networks through topology control. In: DIALM-POMC \u201905: Proceedings of the Joint Workshop on Foundations of Mobile Computing, pp. 17\u201323 (2005)","DOI":"10.1145\/1080810.1080815"},{"key":"83_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: PODC \u201905: Proceedings of the 24th ACM Symposium on the Principles of Distributed Computing, pp. 60\u201368 (2005)","DOI":"10.1145\/1073814.1073826"},{"key":"83_CR12","doi-asserted-by":"crossref","unstructured":"Salamatian, K., Iannone, L., Khalili, R., Fdida, S.: Cross-layer routing in wireless mesh networks. In: 1st International Symposium on Wireless Communication Systems, pp. 319\u2013323 (2004)","DOI":"10.1109\/ISWCS.2004.1407261"},{"key":"83_CR13","doi-asserted-by":"crossref","unstructured":"Li, X.-Y., Nejad, K.M., Song, W.-Z., Wang, W.-Z.: Interference-aware topology control for wireless sensor networks. In: SECON\u201905: Sensor and Ad Hoc Communications and Networks, pp. 263\u2013274 (2005)","DOI":"10.1109\/SAHCN.2005.1557081"},{"key":"83_CR14","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad hoc and sensor networks. In: DIALM-POMC\u201905: Proceedings of the 3rd ACM Joint Workshop on Foundations of Mobile Computing, September 2005","DOI":"10.1145\/1080810.1080816"},{"key":"83_CR15","unstructured":"Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol design beyond graph-based models. In: 5th Workshop on Hot Topics in Networks (HotNets), pp. 25\u201330, November 2006"},{"key":"83_CR16","doi-asserted-by":"crossref","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. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"2","key":"83_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/564585.564602","volume":"33","author":"R. Rajaraman","year":"2002","unstructured":"Rajaraman R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60\u201373 (2002)","journal-title":"SIGACT News"},{"key":"83_CR18","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/B978-044482537-7\/50021-8","volume-title":"Handbook of Computational Geometry","author":"M. Smid","year":"2000","unstructured":"Smid M.: Closest-point problems in computational geometry. In: Sack, J.-R., Urrutia, J.(eds) Handbook of Computational Geometry, pp. 877\u2013935. Elsevier, Amsterdam (2000)"},{"key":"83_CR19","doi-asserted-by":"crossref","unstructured":"von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A robust interference model for wireless ad-hoc networks. In: IPDPS \u201905: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium-Workshop 12, pp. 239.1, 2005","DOI":"10.1109\/IPDPS.2005.65"},{"key":"83_CR20","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast routing in static ad hoc wireless networks. ACM Wireless Networking (WINET), vol. 8(6), pp. 607\u2013617, November 2002","DOI":"10.1023\/A:1020381720601"},{"key":"83_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, X.-Y.: Distributed spanner with bounded degree for wireless ad hoc networks. In: IPDPS \u201902: Proceedings of the 16th IEEE International Parallel and Distributed Processing Symposium, pp. 194\u2013201, 2002","DOI":"10.1109\/IPDPS.2002.1016598"},{"issue":"4","key":"83_CR22","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C.-C. Yao","year":"1982","unstructured":"Yao A. C.-C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."},{"key":"83_CR23","doi-asserted-by":"crossref","unstructured":"Zuniga, M., Krishnamachari, B.: An analysis of unreliability and asymmetry in low-power wireless links. ACM Trans. Sens. Netw 3(2), 2007","DOI":"10.1145\/1240226.1240227"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0083-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-009-0083-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0083-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T08:46:18Z","timestamp":1739177178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-009-0083-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s00446-009-0083-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2009,4]]}}}