{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:49Z","timestamp":1759638589389},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_37","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"364-373","source":"Crossref","is-referenced-by-count":15,"title":["Approximate MST for UDG Locally"],"prefix":"10.1007","author":[{"given":"Xiang-Yang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"unstructured":"Li, X.Y., Calinescu, G., Wan, P.J.: Distributed construction of planar spanner and routing for ad hoc wireless networks. In: 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). Volume 3. (2002)","key":"37_CR1"},{"unstructured":"Li, X.Y., Wan, P.J., Wang, Y., Frieder, O.: Sparse power efficient topology for wireless networks. Journal of Parallel and Distributed Computing (2002) To appear. Preliminary version appeared in ICCCN 2001.","key":"37_CR2"},{"doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: IEEE INFOCOM. (2000)","key":"37_CR3","DOI":"10.1109\/INFCOM.2000.832213"},{"doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, X.Y.: Geometric spanners for wireless ad hoc networks. In: Proc. of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS). (2002)","key":"37_CR4","DOI":"10.1109\/ICDCS.2002.1022254"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. ACM\/KluwerWireless Networks 7 (2001) 609\u2013616 3rd int. Workshop on Discrete Algorithms and methods for mobile computing and communications, 1999, 48\u201355.","journal-title":"ACM\/KluwerWireless Networks"},{"doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: ACM\/IEEE International Conference on Mobile Computing and Networking. (2000)","key":"37_CR6","DOI":"10.1145\/345910.345953"},{"doi-asserted-by":"crossref","unstructured":"Li, X.Y., Wang, Y.: Localized construction of bounded degree planar spanner for wireless networks (2003) Submitted for publication.","key":"37_CR7","DOI":"10.1007\/3-540-45071-8_38"},{"unstructured":"Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. ACM Wireless Networks (2002) Preliminary version appeared in IEEE INFOCOM 2000.","key":"37_CR8"},{"doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Molle, M.: Creating optimal distributed algorithms for minimum spanning trees. Technical Report Technical Report CSRI-327 (also submitted in WDAG\u2019 95) (1995)","key":"37_CR9","DOI":"10.1145\/224964.225474"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimumweight spanning trees. ACM Transactions on Programming Languages and Systems 5 (1983) 66\u201377","journal-title":"ACM Transactions on Programming Languages and Systems"},{"unstructured":"Clementi, A., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (2001) To approach. Preliminary results in APPROX\u201999 and STACS\u20192000.","key":"37_CR11"},{"doi-asserted-by":"crossref","unstructured":"Wieselthier, J., Nguyen, G., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc. IEEE INFOCOM 2000. (2000) 586\u2013594","key":"37_CR12","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/584066.584069","volume":"5","author":"M. Seddigh","year":"2002","unstructured":"Seddigh, M., Gonzalez, J.S., Stojmenovic, I.: Rng and internal node based broadcasting algorithms for wireless one-to-one networks. ACM Mobile Computing and Communications Review 5 (2002) 37\u201344","journal-title":"ACM Mobile Computing and Communications Review"},{"unstructured":"Li, X.Y., Wan, P.J., Wang, Y., Frieder, O.: Sparse power efficient topology for wireless networks. In: IEEE Hawaii Int. Conf. on System Sciences (HICSS). (2002)","key":"37_CR14"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighborhood graph of a finite planar set. Pattern Recognition 12 (1980) 261\u2013268","journal-title":"Pattern Recognition"},{"unstructured":"Das, G., Narasimhan, G., Salowe, J.: A new way to weigh malnourished euclidean graphs. In: ACM Symposium of Discrete Algorithms. (1995) 215\u2013222","key":"37_CR16"},{"key":"37_CR17","series-title":"Lect Notes Comput Sci","volume-title":"18th Annual Symposium on Theoretical Aspects of Computer Science","author":"A. Clementi","year":"2001","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010. (2001)"},{"doi-asserted-by":"crossref","unstructured":"Li, X.Y., Wang, Y.: Efficient construction of low weight bounded degree planar spanner (2003). COCOON 2003.","key":"37_CR18","DOI":"10.1007\/3-540-45071-8_38"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T14:58:32Z","timestamp":1684076312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}