{"id":"https://openalex.org/W7134978296","doi":"https://doi.org/10.48550/arxiv.2603.09834","title":"Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree","display_name":"Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree","publication_year":2026,"publication_date":"2026-03-10","ids":{"openalex":"https://openalex.org/W7134978296","doi":"https://doi.org/10.48550/arxiv.2603.09834"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.09834","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09834","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"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.09834","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":"middle","author":{"id":"https://openalex.org/A5082659766","display_name":"Saeed Odak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Odak, Saeed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128788325","display_name":"Satyam Singh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singh, Satyam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128780497","display_name":"Geert van Wordragen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Wordragen, Geert","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6456999778747559,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6456999778747559,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1972000002861023,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.03880000114440918,"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/quadtree","display_name":"Quadtree","score":0.7433000206947327},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6288999915122986},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5023000240325928},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43630000948905945},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.42309999465942383},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.40139999985694885},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3878999948501587},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3779999911785126}],"concepts":[{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.7433000206947327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7391999959945679},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6288999915122986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5073000192642212},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43630000948905945},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4041999876499176},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.40139999985694885},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3878999948501587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38449999690055847},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.37380000948905945},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C168185519","wikidata":"https://www.wikidata.org/wiki/Q5156577","display_name":"Complex dimension","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.09834","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09834","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.09834","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09834","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,39,120],"give":[1],"an":[2,42,58],"approximation":[3],"scheme":[4],"for":[5,27,44,129],"the":[6,45,51,77,83,91,127],"TSP":[7],"in":[8,36,132,135],"$d$-dimensional":[9],"hyperbolic":[10,46,79,94],"space":[11],"that":[12,122],"has":[13],"optimal":[14],"dependence":[15],"on":[16,63],"$\\varepsilon$":[17],"under":[18],"Gap-ETH.":[19],"For":[20],"any":[21,28],"fixed":[22],"dimension":[23],"$d\\geq":[24],"2$":[25],"and":[26,98,110],"$\\varepsilon>0$":[29],"our":[30,111],"randomized":[31],"algorithm":[32,43,56],"gives":[33],"a":[34,64,72,105,115],"$(1+\\varepsilon)$-approximation":[35],"time":[37],"$2^{O(1/\\varepsilon^{d-1})}n^{1+o(1)}$.":[38],"also":[40],"provide":[41],"Steiner":[47],"tree":[48],"problem":[49],"with":[50],"same":[52],"running":[53],"time.":[54],"Our":[55],"is":[57],"Arora-style":[59],"dynamic":[60],"program":[61],"based":[62],"randomly":[65],"shifted":[66],"hierarchical":[67,74],"decomposition.":[68],"However,":[69],"we":[70,103],"introduce":[71],"new":[73,106,116],"decomposition":[75],"called":[76],"hybrid":[78],"quadtree":[80,95],"to":[81],"achieve":[82],"desired":[84],"large-scale":[85],"structure,":[86],"which":[87],"deviates":[88],"significantly":[89],"from":[90],"recently":[92],"proposed":[93],"of":[96],"Kisfaludi-Bak":[97],"Van":[99],"Wordragen":[100],"(JoCG'25).":[101],"Moreover,":[102],"have":[104],"non-uniform":[107],"portal":[108],"placement,":[109],"structure":[112],"theorem":[113],"employs":[114],"weighted":[117],"crossing":[118],"analysis.":[119],"believe":[121],"these":[123],"techniques":[124],"could":[125],"form":[126],"basis":[128],"further":[130],"developments":[131],"geometric":[133],"optimization":[134],"curved":[136],"spaces.":[137]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-12T00:00:00"}