{"id":"https://openalex.org/W7143312728","doi":"https://doi.org/10.48550/arxiv.2603.26397","title":"Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs","display_name":"Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7143312728","doi":"https://doi.org/10.48550/arxiv.2603.26397"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26397","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26397","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124848754","display_name":"S\u00e1ndor Kisfaludi-Bak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kisfaludi-Bak, S\u00e1ndor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130955570","display_name":"D\u00e1niel Marx","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marx, D\u00e1niel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.46959999203681946,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.46959999203681946,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.23440000414848328,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.10740000009536743,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8162999749183655},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6096000075340271},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5753999948501587},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5454999804496765},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4616999924182892},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.444599986076355},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.37860000133514404},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3625999987125397}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8162999749183655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7843999862670898},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7457000017166138},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6096000075340271},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5753999948501587},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4523000121116638},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.37860000133514404},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.36079999804496765},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.33180001378059387},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.2994000017642975},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.27379998564720154}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26397","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26397","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,202],"give":[1],"approximation":[2,163,169],"schemes":[3,164,170],"for":[4,151,165,171,193],"Subset":[5,86,194],"TSP":[6,195],"and":[7,14,101,131,186,189,196],"Steiner":[8,115,152,197],"Tree":[9,153,198],"on":[10,17],"unit":[11,166],"disk":[12],"graphs,":[13],"more":[15],"generally,":[16],"intersection":[18],"graphs":[19],"of":[20,47,69,95,124,180,183,216],"similarly":[21,218],"sized":[22],"connected":[23],"fat":[24,224],"(not":[25],"necessarily":[26],"convex)":[27],"polygons":[28],"in":[29,57,81,98,109,127,139,154,199,210],"the":[30,54,58,61,74,79,211],"plane.":[31],"As":[32],"a":[33,67,91,106,120,136,148],"first":[34],"step":[35],"towards":[36],"this":[37,82],"goal,":[38],"we":[39],"prove":[40],"spanner-type":[41],"results:":[42],"finding":[43],"an":[44],"induced":[45,93,122],"subgraph":[46,94,123],"bounded":[48],"size":[49,96,125],"that":[50,60,162,204,213],"is":[51],"$(1+\\varepsilon)$-equivalent":[52,92,121],"to":[53,104,134],"original":[55],"instance":[56],"sense":[59,212],"optimum":[62],"value":[63],"increases":[64],"only":[65,78],"by":[66],"factor":[68],"at":[70],"most":[71],"$(1+\\varepsilon)$":[72],"when":[73],"solution":[75,108,138,150],"can":[76],"use":[77,102,132],"edges":[80],"subgraph.":[83],"-":[84,113,143],"For":[85,114],"TSP,":[87],"our":[88,117,175,205],"algorithms":[89,118],"find":[90,105,119,135],"$\\mathrm{poly}(1/\\varepsilon)\\cdot\\mathrm{OPT}$":[97],"polynomial":[99],"time,":[100],"it":[103,133],"$(1+\\varepsilon)$-approximate":[107,137,149],"time":[110,128,140,155],"$2^{\\mathrm{poly}(1/\\varepsilon)}\\cdot":[111,129,156],"n^{O(1)}$.":[112,142,157],"Tree,":[116],"$2^{\\mathrm{poly}(1/\\varepsilon)}\\cdot\\mathrm{OPT}$":[126],"n^{O(1)}$,":[130],"$2^{2^{\\mathrm{poly}(1/\\varepsilon)}}\\cdot":[141],"An":[144,158],"improved":[145],"algorithm":[146],"finds":[147],"easy":[159],"reduction":[160],"shows":[161],"disks":[167],"imply":[168],"planar":[172,200],"graphs.":[173,201],"Thus":[174],"results":[176,182,206],"are":[177,207],"far-reaching":[178],"generalizations":[179],"analogous":[181],"Klein":[184],"[STOC'06]":[185],"Borradaile,":[187],"Klein,":[188],"Mathieu":[190],"[ACM":[191],"TALG'09]":[192],"show":[203],"best":[208],"possible":[209],"dropping":[214],"any":[215],"(i)":[217],"sized,":[219],"(ii)":[220],"connected,":[221],"or":[222],"(iii)":[223],"makes":[225],"both":[226],"problems":[227],"APX-hard.":[228]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-31T00:00:00"}