{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:59:23Z","timestamp":1725469163007},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_5","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"50-60","source":"Crossref","is-referenced-by-count":6,"title":["Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Yaroslavtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math.\u00a012(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/1041680.1041683","volume":"36","author":"R. Bar-Yehuda","year":"2004","unstructured":"Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon even 1935-2004. ACM Comput. Surv.\u00a036(4), 422\u2013463 (2004)","journal-title":"ACM Comput. Surv."},{"key":"5_CR3","first-page":"344","volume-title":"SODA 1994","author":"R. Bar-Yehuda","year":"1994","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J.S., Roth, R.M.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In: SODA 1994, pp. 344\u2013354. SIAM, Philadelphia (1994), \n                    \n                      http:\/\/dl.acm.org\/citation.cfm?id=314464.314514"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A. Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell.\u00a083(1), 167\u2013188 (1996)","journal-title":"Artif. Intell."},{"key":"5_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":"5_CR6","first-page":"590","volume-title":"SODA 2005","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between fpt algorithms and ptass. In: SODA 2005, pp. 590\u2013601. SIAM, Philadelphia (2005), \n                    \n                      http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070514"},{"key":"5_CR7","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":"5_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., (Seffi) Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput.\u00a025, 235\u2013251 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR10","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 J. Comput.\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"5_CR11","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"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., Moss, A., Naor, J., Schieber, B.: Efficient recovery from power outage (extended abstract). In: STOC 1999, pp. 574\u2013582 (1999)","DOI":"10.1145\/301250.301406"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/370155.370304","volume-title":"ASP-DAC 2001","author":"A.B. Kahng","year":"2001","unstructured":"Kahng, A.B., Vaya, S., Zelikovsky, A.: New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. In: ASP-DAC 2001, pp. 133\u2013138. ACM, New York (2001)"},{"key":"5_CR14","unstructured":"Klein, P.: Optimization Algorithms for Planar Graphs, \n                    \n                      http:\/\/www.planarity.org\/"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P.N. Klein","year":"1995","unstructured":"Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. J. Algorithms\u00a019(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-02026-1_4","volume-title":"Combinatorial Optimization and Applications","author":"X. Li","year":"2009","unstructured":"Li, X., Xu, X.-H., Zou, F., Du, H., Wan, P., Wang, Y., Wu, W.: A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 36\u201348. Springer, Heidelberg (2009)"},{"key":"5_CR17","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":"2","key":"5_CR18","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 J. Comput.\u00a037(2), 460\u2013481 (2007)","journal-title":"SIAM J. Comput."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11538462_19","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"J. Remy","year":"2005","unstructured":"Remy, J., Steger, A.: Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX and RANDOM 2005. LNCS, vol.\u00a03624, pp. 221\u2013232. Springer, Heidelberg (2005)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/800133.804355","volume-title":"STOC 1978","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node-and edge-deletion np-complete problems. In: STOC 1978, pp. 253\u2013264. ACM, New York (1978)"}],"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_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:38Z","timestamp":1620129938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}