{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:57Z","timestamp":1770994137160,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315930","type":"print"},{"value":"9783642315947","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_18","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"206-217","source":"Crossref","is-referenced-by-count":8,"title":["Node-Weighted Network Design in Planar and Minor-Closed Families of 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":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing\u00a024(3), 440\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: Proc. of ACM STOC 2010, pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00493-006-0016-z","volume":"26","author":"J. Cheriyan","year":"2006","unstructured":"Cheriyan, J., Vempala, S., Vetta, A.: Network design via iterative rounding of setpair relaxations. Combinatorica\u00a026(3), 255\u2013275 (2006)","journal-title":"Combinatorica"},{"key":"18_CR4","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 FOCS, pp. 437\u2013441. IEEE (2009)","DOI":"10.1109\/FOCS.2009.38"},{"key":"18_CR5","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., Klein, P.N.: 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":"18_CR6","unstructured":"Goemans, M.X., Goldberg, A.V., Plotkin, S., Shmoys, D.B., Tardos, E., Williamson, D.P.: Improved approximation algorithms for network design problems. In: Proc. of ACM-SIAM SODA, pp. 223\u2013232 (1994)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024, 296 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR8","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation Algorithms for NP-Hard Problems, pp. 144\u2013191. PWS Publishing Co. (1996)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.sorms.2010.06.001","volume":"16","author":"A. Gupta","year":"2011","unstructured":"Gupta, A., K\u00f6nemann, J.: Approximation algorithms for network design: A survey. Surveys in Operations Research and Management Science\u00a016(1), 3\u201320 (2011)","journal-title":"Surveys in Operations Research and Management Science"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0196-6774(02)00222-5","volume":"45","author":"K. Jain","year":"2002","unstructured":"Jain, K., Mandoiu, I., Vazirani, V.V., Williamson, D.P.: A primal-dual schema based approximation algorithm for the element connectivity problem. Journal of Algorithms\u00a045(1), 1\u201315 (2002)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"18_CR12","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. Journal of Algorithms\u00a019(1), 104\u2013115 (1995)","journal-title":"Journal of Algorithms"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Handbook on Approximation Algorithms and Metaheuristics. Chapman and Hall\/CRC (2007)","DOI":"10.1201\/9781420010749.ch58"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-642-22006-7_63","volume-title":"Automata, Languages and Programming","author":"C. Moldenhauer","year":"2011","unstructured":"Moldenhauer, C.: Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 748\u2013759. Springer, Heidelberg (2011)"},{"issue":"7","key":"18_CR15","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 Journal of Computing\u00a039(7), 3001\u20133022 (2010)","journal-title":"SIAM Journal of Computing"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Nutov, Z.: Approximating Steiner network activation problems. In: Proc. of LATIN (2012)","DOI":"10.1007\/978-3-642-29344-3_50"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Panigrahi, D.: Survivable network design problems in wireless networks. In: Proc. of ACM-SIAM SODA (2011)","DOI":"10.1137\/1.9781611973082.78"},{"issue":"3","key":"18_CR18","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)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:14:51Z","timestamp":1620130491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}