{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:22Z","timestamp":1725465562333},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_1","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"1-12","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost"],"prefix":"10.1007","author":[{"given":"Hasna Mohsen","family":"Alqahtani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-39658-1_13","volume-title":"Algorithms - ESA 2003","author":"G. Calinescu","year":"2003","unstructured":"Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 114\u2013126. Springer, Heidelberg (2003)"},{"key":"1_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)"},{"key":"1_CR4","unstructured":"Feige, U., Kogan, S.: Hardness of approximation of the balanced complete bipartite subgraph problem. Technical report MCS04-04, Department of Computer Science and Applied Math., The Weizmann Institute of Science (2004)"},{"key":"1_CR5","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.\u00a0H. Freeman and Company, New York, San Francisco (1979)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11496915_26","volume-title":"Integer Programming and Combinatorial Optimization","author":"M.T. Hajiaghayi","year":"2005","unstructured":"Hajiaghayi, M.T., Kortsarz, G., Mirrokni, V.S., Nutov, Z.: Power optimization for connectivity problems. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 349\u2013361. Springer, Heidelberg (2005)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-75520-3_10","volume-title":"Algorithms \u2013 ESA 2007","author":"Y. Lando","year":"2007","unstructured":"Lando, Y., Nutov, Z.: On minimum power connectivity problems. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 87\u201398. Springer, Heidelberg (2007)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11830924_23","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Z. Nutov","year":"2006","unstructured":"Nutov, Z.: Approximating minimum power covers of intersecting families and directed connectivity problems. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 236\u2013247. Springer, Heidelberg (2006)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-642-29344-3_50","volume-title":"LATIN 2012: Theoretical Informatics","author":"Z. Nutov","year":"2012","unstructured":"Nutov, Z.: Survivable network activation problems. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 594\u2013605. Springer, Heidelberg (2012)"},{"issue":"7","key":"1_CR10","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1137\/080729645","volume":"39","author":"Z. Nutov","year":"2010","unstructured":"Nutov, Z.: Approximating Steiner networks with node-weights. SIAM J. Comput.\u00a039(7), 3001\u20133022 (2010)","journal-title":"SIAM J. Comput."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Panigrahi, D.: Survivable network design problems in wireless networks. In: 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1014\u20131027. SIAM (2011)","DOI":"10.1137\/1.9781611973082.78"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s11276-005-1765-0","volume":"11","author":"A. Srinivas","year":"2005","unstructured":"Srinivas, A., Modiano, E.: Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks. Wireless Networks\u00a011(4), 401\u2013417 (2005)","journal-title":"Wireless Networks"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"Suurballe, J.W.: Disjoint paths in a network. Networks\u00a04, 125\u2013145 (1974)","journal-title":"Networks"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014, 325\u2013336 (1984)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:54:00Z","timestamp":1557698040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}