{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:37Z","timestamp":1781078257831,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030617912","type":"print"},{"value":"9783030617929","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_1","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PTAS for Steiner Tree on Map Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3387-0913","authenticated-orcid":false,"given":"Jaros\u0142aw","family":"Byrka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2912-099X","authenticated-orcid":false,"given":"Mateusz","family":"Lewandowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1771-403X","authenticated-orcid":false,"given":"Syed Mohammad","family":"Meesum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6452","authenticated-orcid":false,"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3999-7827","authenticated-orcid":false,"given":"Sumedha","family":"Uniyal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"key":"1_CR1","unstructured":"Arora, S., Grigni, M., Karger, D.R., Klein, P.N., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25\u201327 January 1998, San Francisco, California, USA, pp. 33\u201341 (1998)"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"1_CR3","unstructured":"Bateni, M., Chekuri, C., Ene, A., Hajiaghayi, M.T., Korula, N., Marx, D.: Prize-collecting Steiner problems on planar graphs. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23\u201325, 2011, pp. 1028\u20131049 (2011)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bateni, M., Demaine, E.D., Hajiaghayi, M., Marx, D.: A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 570\u2013583 (2016)","DOI":"10.1145\/2897518.2897549"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bateni, M., Farhadi, A., Hajiaghayi, M.: Polynomial-time approximation scheme for minimum k-cut in planar and minor-free graphs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January 2019, pp. 1055\u20131068 (2019)","DOI":"10.1137\/1.9781611975482.65"},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2027216.2027219","volume":"58","author":"M Bateni","year":"2011","unstructured":"Bateni, M., Hajiaghayi, M.T., Marx, D.: Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58(5), 21:1\u201321:37 (2011)","journal-title":"J. ACM"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Berman, P., Yaroslavtsev, G.: Primal-dual approximation algorithms for node-weighted network design in planar graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, 15\u201317 August 2012. Proceedings, pp. 50\u201360 (2012)","DOI":"10.1007\/978-3-642-32512-0_5"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/1541885.1541892","volume":"5","author":"G Borradaile","year":"2009","unstructured":"Borradaile, G., Klein, P., Mathieu, C.: An o(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithms 5, 31:1\u201331:31 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/net.21825","volume":"72","author":"A Buchanan","year":"2018","unstructured":"Buchanan, A., Wang, Y., Butenko, S.: Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72(2), 238\u2013248 (2018)","journal-title":"Networks"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1\u20136:33 (2013)","journal-title":"J. ACM"},{"key":"1_CR11","unstructured":"Byrka, J., Lewandowski, M., Meesum, S.M., Spoerhase, J., Uniyal, S.: PTAS for steiner tree on map graphs. CoRR abs\/1912.00717 (2019), http:\/\/arxiv.org\/abs\/1912.00717"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.dam.2015.03.004","volume":"189","author":"S Cabello","year":"2015","unstructured":"Cabello, S., Gajser, D.: Simple ptas\u2019s for families of graphs excluding a minor. Discrete Appl. Math. 189, 41\u201348 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/506147.506148","volume":"49","author":"Z Chen","year":"2002","unstructured":"Chen, Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127\u2013138 (2002)","journal-title":"J. ACM"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jda.2012.04.016","volume":"16","author":"M Chimani","year":"2012","unstructured":"Chimani, M., Mutzel, P., Zey, B.: Improved Steiner tree algorithms for bounded treewidth. J. Discrete Algorithms 16, 67\u201378 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/17M112717X","volume":"48","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for k-means and k-median in euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644\u2013667 (2019)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2601070","volume":"10","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Klein, P.N.: Node-weighted Steiner tree and group Steiner tree in planar graphs. ACM Trans. Algorithms 10(3), 13:1\u201313:20 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","journal-title":"Networks"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Eisenstat, D., Klein, P.N., Mathieu, C.: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 626\u2013638 (2012)","DOI":"10.1137\/1.9781611973099.53"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Guha, S., Moss, A., Naor, J., Schieber, B.: Efficient recovery from power outage (extended abstract). In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1\u20134 May 1999, Atlanta, Georgia, USA, pp. 574\u2013582 (1999)","DOI":"10.1145\/301250.301406"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2016.06.040","volume":"645","author":"F Kammer","year":"2016","unstructured":"Kammer, F., Tholey, T.: Approximate tree decompositions of planar graphs in linear time. Theoret. Comput. Sci. 645, 60\u201390 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: A subset spanner for planar graphs: with application to subset TSP. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, 21\u201323 May 2006, pp. 749\u2013756 (2006)","DOI":"10.1145\/1132516.1132620"},{"issue":"6","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1137\/060649562","volume":"37","author":"PN Klein","year":"2008","unstructured":"Klein, P.N.: A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights. SIAM J. Comput. 37(6), 1926\u20131952 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"PN Klein","year":"1995","unstructured":"Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ic.2012.10.017","volume":"222","author":"C Moldenhauer","year":"2013","unstructured":"Moldenhauer, C.: Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs. Inf. Comput. 222, 293\u2013306 (2013)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T13:09:30Z","timestamp":1697288970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}