{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:49Z","timestamp":1759637569506},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,3,31]],"date-time":"2006-03-31T00:00:00Z","timestamp":1143763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s11036-006-4466-8","type":"journal-article","created":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T04:59:58Z","timestamp":1143867598000},"page":"121-128","source":"Crossref","is-referenced-by-count":26,"title":["Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Gruia","family":"Calinescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,3,31]]},"reference":[{"key":"4466_CR1","doi-asserted-by":"crossref","unstructured":"E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski and A. Zelikovsky, Power efficient range assignment in ad-hoc wireless networks, in: Proc. IEEE Wireless Communications and Networking Conference (2003) pp. 1889\u20131894.","DOI":"10.1109\/WCNC.2003.1200675"},{"key":"4466_CR2","doi-asserted-by":"crossref","unstructured":"D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (Aug. 2002) pp. 71\u201382.","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"4466_CR3","doi-asserted-by":"crossref","unstructured":"T. Calamoneri, and R. Petreschi, An efficient orthogonal grid drawing algorithm for cubic graphs, COCOON\u201995, Lectures Notes in Computer Science 959 (Springer-Verlag, 1995) pp. 31\u201340.","DOI":"10.1007\/BFb0030817"},{"key":"4466_CR4","doi-asserted-by":"crossref","unstructured":"G. Calinescu, I. Mandoiu, and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (Aug. 2002) pp. 119\u2013130.","DOI":"10.1007\/978-0-387-35608-2_11"},{"issue":"3","key":"4466_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/26.20105","volume":"37","author":"W.T. Chen","year":"Oct. 1989","unstructured":"W.T. Chen and N.F. Huang, The strongly connecting problem on multihop packet radio networks, IEEE Transactions on Communications, 37(3) (1989) 293\u2013295.","journal-title":"IEEE Transactions on Communications"},{"key":"4466_CR6","unstructured":"A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010 (2001) pp. 121\u2013131."},{"key":"4466_CR7","doi-asserted-by":"crossref","unstructured":"A. Clementi, P. Penna and R. Silvestri, On the power assignment problem in radio networks, Electronic Colloquium on Computational Complexity (ECCC), nr. 054 (2000). \u201cThe power range assignment problem in radio networks on the Plane,\u201d in: Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1770 (2000) pp. 651\u2013660.","DOI":"10.1007\/3-540-46541-3_54"},{"key":"4466_CR8","unstructured":"A. Clementi, G. Huiban, P. Penna, G. Rossi and Y.C. Verhoeven, Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks, in: 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (2002) pp. 23\u201338."},{"key":"4466_CR9","volume-title":"Graduate Texts in Mathematics","author":"R. Diestel","year":"February 2000","unstructured":"R. Diestel, Graph Theory, 2nd edition, Graduate Texts in Mathematics, vol. 173 (Springer-Verlag, New York, Feb. 2000).","edition":"2nd Edition"},{"key":"4466_CR10","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, R. Rustin (Ed.) (Algorithmics Press, New York, 1972) pp. 91\u201396."},{"key":"4466_CR11","doi-asserted-by":"crossref","unstructured":"J. Edmonds, Matroid intersection, Annals of Discrete Mathematics (4) (1979) 185\u2013204.","DOI":"10.1016\/S0167-5060(08)70817-3"},{"key":"4466_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"A. Frank and \u00c9. Tardos, An application of submodular flows, Linear Algebra and its Applications 114\/115 (1989) 329\u2013348.","journal-title":"Linear Algebra and its Applications"},{"key":"4466_CR13","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, in: Proc. 23rd ACM Symposium on Theory of Computing (May 1991) pp. 112\u2013122.","DOI":"10.1145\/103418.103436"},{"key":"4466_CR14","unstructured":"H.N. Gabow, A representation for crossing set families with applications to submodular flow problems, in: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993) pp. 202\u2013211."},{"issue":"1","key":"4466_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"R. Gallager and P. Humblet and P. Spira, A distributed algorithm for minimum weight spanning trees, ACM Transactions on Programming Languages and Systems 5(1) (1983) 66\u201377.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4466_CR16","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson and R.E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput. 5 (1976) 704\u2013714.","journal-title":"SIAM J. Comput."},{"key":"4466_CR17","doi-asserted-by":"crossref","unstructured":"M. Hajiaghayi, N. Immorlica and V. Mirrokni, Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks, in:Proc. MobiCom 2003 (San Diego, CA, Sept. 2003) pp. 300\u2013312.","DOI":"10.1145\/938985.939016"},{"key":"4466_CR18","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms 21 (1996) 433\u2013450.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"4466_CR19","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM 41(2) (1994) 214\u2013235.","journal-title":"Journal of ACM"},{"key":"4466_CR20","unstructured":"L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243(1\u20132) (2000) 289\u2013305. A preliminary version of this papers also appeared in Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1200 (1997) pp. 363\u2013374."},{"key":"4466_CR21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"E. L. Lawler","year":"1975","unstructured":"E.L. Lawler, Matroid intersection algorithms, Mathematical Programming 9 (1975) 31\u201356.","journal-title":"Mathematical Programming"},{"key":"4466_CR22","first-page":"127","volume":"9\/B\/2","author":"Y. Liu","year":"1994","unstructured":"Y. Liu, P. Marchioro, and R. Petreschi, At most single bend embedding of cubic graphs, Applied Mathematics (Chin. Journ.) 9\/B\/2, (1994) pp. 127\u2013142.","journal-title":"Applied Mathematics (Chin. Journ.)"},{"key":"4466_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/513800.513816","volume-title":"Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)","author":"E. Lloyd","year":"June 2002","unstructured":"E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (Lausanne, Switzerland, June 2002) pp. 123\u2013134."},{"key":"4466_CR24","doi-asserted-by":"crossref","unstructured":"T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).","DOI":"10.1007\/978-1-4615-5491-2"},{"key":"4466_CR25","unstructured":"R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: IEEE INFOCOM 2000, vol. 2 (2000) pp. 404\u2013413."},{"key":"4466_CR26","unstructured":"J.H. van Lint and R.M. Wilson, A Course in Combinatorics (Cambridge University Press, 1992)."},{"key":"4466_CR27","unstructured":"P.-J. Wan, G. Calinescu, X.-Y. Li and O. Frieder, Minimum energy broadcast routing in static ad hoc wireless networks, in: IEEE INFOCOM 2001, vol. 2 (2001) pp. 1162\u20131171."},{"issue":"3","key":"4466_CR28","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190110309","volume":"11","author":"R.W. Whitty","year":"1987","unstructured":"R.W. Whitty, Vertex-disjoint paths and edge-disjoint branchings in directed graphs, J. Graph Theory 11(3) (1987) 349\u2013358.","journal-title":"J. Graph Theory"},{"key":"4466_CR29","unstructured":"J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: IEEE INFOCOM 2000, vol. 2 (2000) pp. 585\u2013594."}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-006-4466-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-006-4466-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-006-4466-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T22:30:35Z","timestamp":1683412235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-006-4466-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,31]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["4466"],"URL":"https:\/\/doi.org\/10.1007\/s11036-006-4466-8","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,31]]}}}