{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:33Z","timestamp":1781028273697,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["363444"],"award-info":[{"award-number":["363444"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800815","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1025-1036","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-2902","authenticated-orcid":false,"given":"S\u00e1ndor","family":"Kisfaludi-Bak","sequence":"first","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5686-8314","authenticated-orcid":false,"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00085"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_100"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326122"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00454-023-00609-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_1_6_1","volume-title":"A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP","author":"Arora Sanjeev","unstructured":"Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, and Andrzej Woloszyn. 1998. A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. In SODA. ACM\/SIAM, 33\u201341. http:\/\/dl.acm.org\/citation.cfm?id=314613.314632"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Sanjeev Arora Prabhakar Raghavan and Satish Rao. 1998. Approximation Schemes for Euclidean k-Medians and Related Problems. In STOC. ACM 106\u2013113. https:\/\/doi.org\/10.1145\/276698.276718 10.1145\/276698.276718","DOI":"10.1145\/276698.276718"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3656042"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Yair Bartal and Lee-Ad Gottlieb. 2021. Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. In STOC. ACM 1028\u20131041. https:\/\/doi.org\/10.1145\/3406325.3451063 10.1145\/3406325.3451063","DOI":"10.1145\/3406325.3451063"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"MohammadHossein Bateni Erik D. Demaine MohammadTaghi Hajiaghayi and D\u00e1niel Marx. 2016. A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. In STOC. ACM 570\u2013583. https:\/\/doi.org\/10.1145\/2897518.2897549 10.1145\/2897518.2897549","DOI":"10.1145\/2897518.2897549"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.65"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-011-9491-8"},{"key":"e_1_3_2_1_14_1","unstructured":"MohammadHossein Bateni MohammadTaghi Hajiaghayi Philip N. Klein and Claire Mathieu. [n. d.]. A polynomial-time approximation scheme for planar multiway cut. In SODA."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027216.2027219"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_10"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101622"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433160"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-012-9662-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2831235"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1541885.1541892"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629654"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34029-2_7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX-RANDOM.2017.3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16988-5_2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.29"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.138"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.95"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Vincent Cohen-Addad \u00c9ric Colin de Verdi\u00e8re Philip N. Klein Claire Mathieu and David Meierfrankenfeld. 2016. Approximating connectivity domination in weighted bounded-genus graphs. In STOC. ACM 584\u2013597. https:\/\/doi.org\/10.1145\/2897518.2897635 10.1145\/2897518.2897635","DOI":"10.1145\/2897518.2897635"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477541"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00061"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M112717X"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00140"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2019.41"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2019.33"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00042"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00066"},{"key":"e_1_3_2_1_39_1","volume-title":"Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs","author":"Czumaj Artur","unstructured":"Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, and Hairong Zhao. 2004. Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. In SODA. SIAM, 496\u2013505. http:\/\/dl.acm.org\/citation.cfm?id=982792.982863"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-019-00561-0"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1469122"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2018.10.007"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2341-5"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601070"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.53"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.12.4.634"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402676"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","unstructured":"Kyle Fox Philip N. Klein and Shay Mozes. 2015. A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. In STOC. ACM 841\u2013850. https:\/\/doi.org\/10.1145\/2746539.2746564 10.1145\/2746539.2746564","DOI":"10.1145\/2746539.2746564"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.66"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492665"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338512"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12920-0_5"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/JAGM.1997.0903"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/S10107-024-02106-Y"},{"key":"e_1_3_2_1_55_1","unstructured":"S\u00e1ndor Kisfaludi-Bak and D\u00e1niel Marx. 2026. Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs. arxiv:2603.26397. arxiv:2603.26397"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00043"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132620"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/060649562"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-023-01128-W"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_41"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.26"},{"key":"e_1_3_2_1_62_1","volume-title":"The limited blessing of low dimensionality: when $ 1-1\/d$ is the best possible exponent for $ d$ -dimensional geometric problems. CoRR, abs\/1612.01171","author":"Marx D\u00e1niel","year":"2016","unstructured":"D\u00e1niel Marx and Anastasios Sidiropoulos. 2016. The limited blessing of low dimensionality: when $ 1-1\/d$ is the best possible exponent for $ d$ -dimensional geometric problems. CoRR, abs\/1612.01171 (2016), arXiv:1612.01171. arxiv:1612.01171"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.64"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2018.65"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276868"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.12"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:55:46Z","timestamp":1781027746000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":66,"alternative-id":["10.1145\/3798129.3800815","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800815","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}