{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T18:22:26Z","timestamp":1775758946869,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"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":[[2015,10]]},"DOI":"10.1007\/s10878-013-9652-6","type":"journal-article","created":{"date-parts":[[2013,8,26]],"date-time":"2013-08-26T08:30:45Z","timestamp":1377505845000},"page":"563-578","source":"Crossref","is-referenced-by-count":6,"title":["Approximating minimum power edge-multi-covers"],"prefix":"10.1007","volume":"30","author":[{"given":"Nachshon","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"issue":"3","key":"9652_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E Althaus","year":"2006","unstructured":"Althaus E, Calinescu G, Mandoiu I, Prasad S, Tchervenski N, Zelikovsky A (2006) Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks. Wirel Netw 12(3):287\u2013299","journal-title":"Wirel Netw"},{"key":"9652_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"19","author":"D Angluin","year":"1979","unstructured":"Angluin D, Valiant L (1979) Fast probabilistic algorithms for Hamiltonian circuits and matchings. J Comp Syst Sci 19:155\u2013193","journal-title":"J Comp Syst Sci"},{"key":"9652_CR3","doi-asserted-by":"crossref","unstructured":"Cheriyan J, V\u00e9gh L (2013) Approximating minimum-cost $$k$$ k -node connected subgraphs via independence-free graphs. FOCS (to appear)","DOI":"10.1109\/FOCS.2013.12"},{"key":"9652_CR4","doi-asserted-by":"crossref","unstructured":"Cohen N, Nutov Z (2012) Approximating minimum power edge-multi-covers. CSR 7353:64\u201375","DOI":"10.1007\/978-3-642-30642-6_7"},{"key":"9652_CR5","doi-asserted-by":"crossref","unstructured":"Fukunaga T, Nutov Z, Ravi R (2013) Iterative rounding approximation algorithms for degree bounded node-connectivity problems (Manuscript)","DOI":"10.1109\/FOCS.2012.30"},{"issue":"1","key":"9652_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-006-0057-5","volume":"110","author":"M Hajiaghayi","year":"2007","unstructured":"Hajiaghayi M, Kortsarz G, Mirrokni V, Nutov Z (2007) Power optimization for connectivity problems. Math. Program 110(1):195\u2013208","journal-title":"Math. Program"},{"issue":"4","key":"9652_CR7","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s00453-009-9365-5","volume":"60","author":"G Kortsarz","year":"2011","unstructured":"Kortsarz G, Mirrokni V, Nutov Z, Tsanko E (2011) Approximating minimum-power degree and connectivity problems. Algorithmica 60(4):735\u2013742","journal-title":"Algorithmica"},{"key":"9652_CR8","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1016\/j.dam.2008.12.001","volume":"157","author":"G Kortsarz","year":"2009","unstructured":"Kortsarz G, Nutov Z (2009) Approximating minimum-power edge-covers and 2,3-connectivity. Discret Appl Math 157:1840\u20131847","journal-title":"Discret Appl Math"},{"issue":"2","key":"9652_CR9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.jda.2009.03.002","volume":"8","author":"Y Lando","year":"2010","unstructured":"Lando Y, Nutov Z (2010) On minimum power connectivity problems. J Discret Algorithms 8(2):164\u2013173","journal-title":"J Discret Algorithms"},{"issue":"4","key":"9652_CR10","first-page":"20532078","volume":"23","author":"J Lee","year":"2010","unstructured":"Lee J, Mirrokni V, Nagarajan V, Sviridenko M (2010) Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J Discret Math 23(4):20532078","journal-title":"SIAM J Discret Math"},{"key":"9652_CR11","unstructured":"Nutov Z (2010a) Approximating minimum-cost edge-covers of crossing biset families. Combinatorica 912\u2013921 (to appear)"},{"issue":"26\u201328","key":"9652_CR12","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1016\/j.tcs.2010.03.009","volume":"411","author":"Z Nutov","year":"2010","unstructured":"Nutov Z (2010b) Approximating minimum power covers of intersecting families and directed edge-connectivity problems. Theor Comp Sci 411(26\u201328):2502\u20132512","journal-title":"Theor Comp Sci"},{"issue":"1\u20132","key":"9652_CR13","first-page":"129","volume":"9","author":"Z Nutov","year":"2010","unstructured":"Nutov Z (2010c) Approximating minimum power $$k$$ k -connectivity. Ad Hoc Sens Wirel Netw 9(1\u20132):129\u2013137","journal-title":"Ad Hoc Sens Wirel Netw"},{"key":"9652_CR14","doi-asserted-by":"crossref","unstructured":"Nutov Z (2012) Survivable network activation problems. Theor Comp Sci 7256:594\u2013605","DOI":"10.1007\/978-3-642-29344-3_50"},{"key":"9652_CR15","doi-asserted-by":"crossref","unstructured":"Panigrahi D (2011) Survivable network design problems in wireless networks. SODA 1014\u20131027","DOI":"10.1137\/1.9781611973082.78"},{"key":"9652_CR16","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2004","unstructured":"Schrijver A (2004) Combinatorial optimization: polyhedra and efficiency. Springer-Verlag, Berlin\/Heidelberg\/New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9652-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9652-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9652-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T01:03:52Z","timestamp":1563757432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9652-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9652"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9652-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,27]]}}}