{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:21:50Z","timestamp":1760440910457},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202608"},{"type":"electronic","value":"9783540396116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39611-6_21","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T22:10:23Z","timestamp":1278022223000},"page":"235-246","source":"Crossref","is-referenced-by-count":29,"title":["Range Assignment for High Connectivity in Wireless Ad Hoc Networks"],"prefix":"10.1007","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","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment in Ad-hoc Wireless Networks. In: Proc. IEEE Wireless Communications and Networking Conference (2003)","DOI":"10.1109\/WCNC.2003.1200675"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (August 2002)","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BFb0030817","volume-title":"Computing and Combinatorics","author":"T. Calamoneri","year":"1995","unstructured":"Calamoneri, T., Petreschi, R.: An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 31\u201340. Springer, Heidelberg (1995)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (August 2002)","DOI":"10.1007\/978-0-387-35608-2_11"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/26.20105","volume":"37","author":"W.T. Chen","year":"1989","unstructured":"Chen, W.T., Huang, N.F.: The Strongly Connecting Problem on Multihop Packet Radio Networks. IEEE Transactions on Communications\u00a037(3), 293\u2013295 (1989)","journal-title":"IEEE Transactions on Communications"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","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: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Clementi","year":"1999","unstructured":"Clementi, A., Penna, P., Silvestri, R.: Hardness Results for The Power Range Assignment Problem in Packet Radio Networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 197\u2013208. Springer, Heidelberg (1999)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/3-540-46541-3_54","volume-title":"STACS 2000","author":"P. Clementi","year":"2000","unstructured":"Clementi, P.: The Power Range Assignment Problem in Radio Networks on the Plane. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 651\u2013660. Springer, Heidelberg (2000)"},{"key":"21_CR9","unstructured":"Clementi, A., Huiban, G., Penna, P., Verhoeven, Y.C.: 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)"},{"key":"21_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","year":"2000","unstructured":"Diestel, R. (ed.): Graph Theory. Graduate Texts in Mathematics, 2nd edn. vol.\u00a0173. Springer, New York (2000)","edition":"2"},{"key":"21_CR11","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J.: Edge-disjoint branchings. In: Rustin, R. (ed.) Combinatorial Algorithms, pp. 91\u201396. Algorithmics Press, New York (1972)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"Edmonds, J.: Matroid intersection. Annals of Discrete Mathematics\u00a04, 185\u2013204 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"Frank, A., Tardos, \u00c9.: An application of submodular flows. Linear Algebra and its Applications\u00a0114\/115, 329\u2013348 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. In: Proc. 23rd ACM Symposium on Theory of Computing, May 1991, pp. 112\u2013122 (1991)","DOI":"10.1145\/103418.103436"},{"key":"21_CR15","unstructured":"Gabow, H.N.: A representation for crossing set families with applications to submodular flow problems. In: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, pp. 202\u2013211 (1993)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The Planar Hamiltonian Circuit Problem is NP-complete. SIAM J. Comput.\u00a05, 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms\u00a021, 433\u2013450 (1996)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of ACM\u00a041(2), 214\u2013235 (1994)","journal-title":"Journal of ACM"},{"issue":"1-2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science\u00a0243(1-2), 289\u2013305 (2000); A preliminary version of this papers also appeared in Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, LNCS,vol\u00a0 1200, pp. 363 - 374 (1997)","journal-title":"Theoretical Computer Science"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"E.L. Lawler","year":"1975","unstructured":"Lawler, E.L.: Matroid intersection algorithms. Mathematical Programming\u00a09, 31\u201356 (1975)","journal-title":"Mathematical Programming"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Lloyd, E., Liu, R., Marathe, M., Ramanathan, R., Ravi, S.S.: 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)","DOI":"10.1145\/513800.513816"},{"key":"21_CR22","volume-title":"Wireless Communications: Principles and Practices","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Rosales-Hain, R.: Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment. In: IEEE INFOCOM 2000 (2000)","DOI":"10.1109\/INFCOM.2000.832213"},{"key":"21_CR24","volume-title":"A course in combinatorics","author":"J.H. Lint van","year":"1992","unstructured":"van Lint, J.H., Wilson, R.M.: A course in combinatorics. Cambridge University Press, Cambridge (1992)"},{"key":"21_CR25","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. In: IEEE INFOCOM 2001 (2001)","DOI":"10.1109\/INFCOM.2001.916310"},{"issue":"3","key":"21_CR26","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/jgt.3190110309","volume":"11","author":"R.W. Whitty","year":"1987","unstructured":"Whitty, R.W.: Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory\u00a011(3), 349\u2013358 (1987)","journal-title":"J. Graph Theory"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: IEEE INFOCOM 2000 (2000)","DOI":"10.1109\/INFCOM.2000.832232"}],"container-title":["Lecture Notes in Computer Science","Ad-Hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39611-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T08:53:21Z","timestamp":1552640001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39611-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202608","9783540396116"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39611-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}