{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:58:20Z","timestamp":1725469100854},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_9","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"98-109","source":"Crossref","is-referenced-by-count":10,"title":["Prize-Collecting Survivable Network Design in Node-Weighted Graphs"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[]},{"given":"Alina","family":"Ene","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Vakilian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/net.10008","volume":"39","author":"C.C. Aggarwal","year":"2002","unstructured":"Aggarwal, C.C., Orlin, J.B.: On multiroute maximum flows in networks. Networks\u00a039(1), 43\u201352 (2002)","journal-title":"Networks"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Mathematical Programming\u00a059(1), 413\u2013420 (1993)","journal-title":"Mathematical Programming"},{"key":"9_CR3","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. of ACM-SIAM SODA, pp. 106\u2013115 (2000)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-20807-2_7","volume-title":"Integer Programming and Combinatoral Optimization","author":"D. Chakrabarty","year":"2011","unstructured":"Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of Capacitated Network Design. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 78\u201391. Springer, Heidelberg (2011)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-31594-7_18","volume-title":"Automata, Languages, and Programming","author":"C. Chekuri","year":"2012","unstructured":"Chekuri, C., Ene, A., Vakilian, A.: Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 206\u2013217. Springer, Heidelberg (2012)"},{"key":"9_CR6","unstructured":"Chudak, F.A., Nagano, K.: Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lov\u00e1sz extension and non-smooth convex optimization. In: Proc. of ACM-SIAM SODA, pp. 79\u201388 (2007)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Khanna, S.: An O(k\n                  3 logn)-approximation algorithm for vertex-connectivity survivable network design. In: Proc. of IEEE FOCS, pp. 437\u2013441 (2009)","DOI":"10.1109\/FOCS.2009.38"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-02927-1_28","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Klein, P.: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 328\u2013340. Springer, Heidelberg (2009)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S., Moss, A., Naor, J.S., Schieber, B.: Efficient recovery from power outage. In: Proc. of ACM STOC, pp. 574\u2013582 (1999)","DOI":"10.1145\/301250.301406"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2007.12.010","volume":"107","author":"S. Gutner","year":"2008","unstructured":"Gutner, S.: Elementary approximation algorithms for prize collecting Steiner tree problems. Information Processing Letters\u00a0107(1), 39\u201344 (2008)","journal-title":"Information Processing Letters"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Jain, K.: The prize-collecting generalized Steiner tree problem via a new approach of primal-dual schema. In: Proc. of ACM-SIAM SODA, pp. 631\u2013640 (2006)","DOI":"10.1145\/1109557.1109626"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-13036-6_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"M.T. Hajiaghayi","year":"2010","unstructured":"Hajiaghayi, M.T., Khandekar, R., Kortsarz, G., Nutov, Z.: Prize-Collecting Steiner Network Problems. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 71\u201384. Springer, Heidelberg (2010)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-12200-2_45","volume-title":"LATIN 2010: Theoretical Informatics","author":"M.T. Hajiaghayi","year":"2010","unstructured":"Hajiaghayi, M.T., Nasri, A.A.: Prize-Collecting Steiner Networks via Iterative Rounding. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 515\u2013526. Springer, Heidelberg (2010)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"1998","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021(1), 39\u201360 (1998); Preliminary version in FOCS 1998","journal-title":"Combinatorica"},{"key":"9_CR15","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proc. of ACM-SIAM SODA, pp. 760\u2013769 (2000)"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D","volume":"27","author":"W. Kishimoto","year":"1996","unstructured":"Kishimoto, W.: A method for obtaining the maximum multiroute flows in a network. Networks\u00a027(4), 279\u2013291 (1996)","journal-title":"Networks"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms\u00a019(1), 104\u2013115 (1995); Preliminary version in IPCO 1993","journal-title":"J. Algorithms"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-93980-1_14","volume-title":"Approximation and Online Algorithms","author":"C. Nagarajan","year":"2009","unstructured":"Nagarajan, C., Sharma, Y., Williamson, D.P.: Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 174\u2013187. Springer, Heidelberg (2009)"},{"issue":"7","key":"9_CR19","doi-asserted-by":"crossref","first-page":"3001","DOI":"10.1137\/080729645","volume":"39","author":"Z. Nutov","year":"2010","unstructured":"Nutov, Z.: Approximating Steiner networks with node-weights. SIAM Journal of Computing\u00a039(7), 3001\u20133022 (2010); Preliminary version in Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.): LATIN 2008. LNCS, vol.\u00a04957. Springer, Heidelberg (2008)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR20","unstructured":"Sharma, Y., Swamy, C., Williamson, D.P.: Approximation algorithms for prize collecting forest problems with submodular penalty functions. In: Proc. of ACM-SIAM SODA, pp. 1275\u20131284 (2007)"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BF01299747","volume":"15","author":"D.P. Williamson","year":"1995","unstructured":"Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V.: A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica\u00a015(3), 435\u2013454 (1995); Preliminary version in STOC 1993","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:43Z","timestamp":1620129943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}