{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:47:48Z","timestamp":1725587268474},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_63","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"748-759","source":"Crossref","is-referenced-by-count":3,"title":["Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Moldenhauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"Bateni, M., Chekuri, C., Ene, A., Hajiaghayi, M., Korula, N., Marx, D.: Prize-collecting Steiner Problems on Planar Graphs. In: 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (2010)","DOI":"10.1137\/1.9781611973082.79"},{"key":"63_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: 42nd ACM Symposium on Theory of Computing, pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"key":"63_CR3","doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M., Marx, D.: Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. In: 42nd ACM Symposium on Theory of Computing, pp. 211\u2013220 (2010)","DOI":"10.1145\/1806689.1806720"},{"issue":"3","key":"63_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1541885.1541892","volume":"5","author":"G. Borradaile","year":"2009","unstructured":"Borradaile, G., Klein, P., Mathieu, C.: An O(n logn) Approximation Scheme for Steiner Tree in Planar Graphs. ACM Transactions on Algorithms\u00a05(3), 1\u201331 (2009)","journal-title":"ACM Transactions on Algorithms"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2008.06.046","volume":"406","author":"M. Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: The Steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science\u00a0406, 207\u2013214 (2008)","journal-title":"Theoretical Computer Science"},{"key":"63_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13520-0_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B. Dilkina","year":"2010","unstructured":"Dilkina, B., Gomes, C.P.: Solving Connected Subgraph Problems in Wildlife Conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 102\u2013116. Springer, Heidelberg (2010)"},{"key":"63_CR7","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":"63_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"issue":"4","key":"63_CR9","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM Journal on Applied Mathematics\u00a032(4), 826\u2013834 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"Guha, S., Moss, A., Naor, J.S., Schieber, B.: Efficient recovery from power outage (extended abstract). In: 31st ACM Symposium on Theory of Computing, pp. 574\u2013582 (1999)","DOI":"10.1145\/301250.301406"},{"key":"63_CR11","unstructured":"Goemans, M.X., Williamson, D.P.: The Primal-Dual Method for Approximation Algorithms and its Application to Network Design Problems, ch. 4, pp. 144\u2013191 (1997), In Hochbaum [Hoc97]"},{"key":"63_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/PL00009810","volume":"18","author":"M.X. Goemans","year":"1998","unstructured":"Goemans, M.X., Williamson, D.P.: Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. Combinatorica\u00a018, 37\u201359 (1998)","journal-title":"Combinatorica"},{"volume-title":"Approximation Algorithms for NP-hard Problems","year":"1997","key":"63_CR13","unstructured":"Hochbaum, D.S. (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston (1997)"},{"key":"63_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"63_CR15","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"},{"issue":"2","key":"63_CR16","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/S0097539702420474","volume":"37","author":"A. Moss","year":"2007","unstructured":"Moss, A., Rabani, Y.: Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems. SIAM Journal on Computing\u00a037(2), 460\u2013481 (2007)","journal-title":"SIAM Journal on Computing"}],"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-22006-7_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:47:50Z","timestamp":1560289670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}