{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T23:49:14Z","timestamp":1770076154590,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10878-005-6858-2","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T09:42:13Z","timestamp":1115113333000},"page":"213-222","source":"Crossref","is-referenced-by-count":32,"title":["Power Assignment for k-Connectivity in Wireless Ad Hoc Networks"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaohua","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongsoo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Makki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Wei","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jagm.1999.1006","volume":"31","author":"V. Auletta","year":"1999","unstructured":"V. Auletta, Y. Dinitz, Z. Nutov, and D. Parente, \u201cA 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph,\u201d J. Algorithms, vol. 31, pp. 21\u201330, 1999.","journal-title":"J. Algorithms"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"D.M. Blough, M. Leoncini, G. Resta, and P. Santi, \u201cOn the symmetric range assignment problem in wireless ad hoc networks,\u201d in Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, August 2002.","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"G. Calinescu, I. Mandoiu, and A. Zelikovsky, \u201cSymmetric connectivity with minimum power consumption in radio networks submitted for journal publication, preliminary results appeared,\u201d in Proc. 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 119\u2013130.","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"CR4","unstructured":"G. Calinescu and P.-J. Wan, High Connectivity with Minimum Total Power in Wireless Ad Hoc Netowrks, Ad Hoc Now, 2003."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J. Cheriyan","year":"1988","unstructured":"J. Cheriyan and S.N. Maheshwari, \u201cFinding nonseparating induced cycles and independent spanning trees in connected graphs,\u201d J. Algorithms, vol. 9, pp. 507\u2013537, 1988.","journal-title":"J. Algorithms"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"J.Cheriyan, S. Vempala, and A.Vetta, \u201cApproximation algorithms for minimum-cost $k$-vertex connected subgraphs,\u201d in Proc. 34th Ann. ACM STOC, May 2002, pp. 306\u2013312.","DOI":"10.1145\/509907.509955"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1006\/jagm.1999.1007","volume":"32","author":"Y. Dinitz","year":"1999","unstructured":"Y. Dinitz and Z. Nutov, \u201cA 3-approximation algorithm for finding optimum 4\/5-vertex-connected spanning subgraphs,\u201d Journal of Algorithms, vol. 32, pp. 31\u201340, 1999.","journal-title":"Journal of Algorithms"},{"key":"CR8","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, \u201cAn application of submodular flows,\u201d Linear Algebra and its Applications, vols. 114\/115, pp. 329\u2013348, 1989.","journal-title":"Linear Algebra and its Applications"},{"key":"CR9","unstructured":"H.N. Gabow, \u201cA representation for crossing set families with applications to submodular flow problems,\u201d in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, pp. 202\u2013211."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"M.T. Hajiaghayi, N. Immorlica, and V.S. Mirrokni, \u201cPower optimization in fault-tolerant topology control algorithms for wireless multi-hop networks,\u201d in Proceedings of the 9th annual international conference on Mobile computing and networking, 2003, pp. 300\u2013312.","DOI":"10.1145\/938985.939016"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"G.Kortsarz and Z. Nutov, \u201cApproximating node connectivity problems via set covers,\u201d in Third International Workshop on Approximation Algorithms for Combinatorial Optimization, (APPROX 2000), Springer, LNCS, vol. 1913, 2000, pp. 194\u2013205.","DOI":"10.1007\/3-540-44436-X_20"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01304873","volume":"23","author":"W. Mader","year":"1972","unstructured":"W. Mader, \u201cEcken vom Grad $n$ \u201cin minimalen $n$-fach zusammenh\u00e4ngenden Graphen,\u201d Arch. Math, vol. 23, pp. 219\u2013224, 1972.","journal-title":"Arch. Math"},{"key":"CR13","unstructured":"W. Mader \u201cDegree and local connectivity in finite graphs,\u201d Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974, Academia, Prague 1975), pp. 341\u2013344."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1006\/jctb.2002.2129","volume":"86","author":"W. Mader","year":"2002","unstructured":"W. Mader, \u201cOn $k$-con-critically $n$-connected Graphs,\u201d Journal of Combinatorial Theory, Series B, vol. 86, pp. 296\u2013314, 2002.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jgt.3190130205","volume":"13","author":"A. Zehavi","year":"1989","unstructured":"A. Zehavi and A. Itai, \u201cThree tree-paths,\u201d J. of Graph Theory, vol. 13, no. 2, pp. 177\u2013188, 1989.","journal-title":"J. of Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-6858-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-6858-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-6858-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:22:06Z","timestamp":1586236926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-6858-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["6858"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-6858-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}