{"id":"https://openalex.org/W6926003765","doi":"https://doi.org/10.20382/jocg.v12i2a3","title":"quasi-polynomial algorithm for well-spaced hyperbolic TSP","display_name":"quasi-polynomial algorithm for well-spaced hyperbolic TSP","publication_year":2022,"publication_date":"2022-02-10","ids":{"openalex":"https://openalex.org/W6926003765","doi":"https://doi.org/10.20382/jocg.v12i2a3"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3604","is_oa":false,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Geometry; Vol. 12 No. 2: Special Issue of Selected Papers from SoCG 2020; 25\u201354","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.20382/jocg.v12i2a3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kisfaludi-Bak, S\u00e1ndor","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kisfaludi-Bak, S\u00e1ndor","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5454872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T14181","display_name":"Academic Freedom and Politics","score":0.027300000190734863,"subfield":{"id":"https://openalex.org/subfields/3320","display_name":"Political Science and International Relations"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T14181","display_name":"Academic Freedom and Politics","score":0.027300000190734863,"subfield":{"id":"https://openalex.org/subfields/3320","display_name":"Political Science and International Relations"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12978","display_name":"Innovative Teaching Methodologies in Social Sciences","score":0.024800000712275505,"subfield":{"id":"https://openalex.org/subfields/3304","display_name":"Education"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12797","display_name":"History of Computing Technologies","score":0.019999999552965164,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5674999952316284},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47929999232292175},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.3995000123977661},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.3614000082015991},{"id":"https://openalex.org/keywords/gaussian-curvature","display_name":"Gaussian curvature","score":0.36010000109672546},{"id":"https://openalex.org/keywords/hyperbolic-geometry","display_name":"Hyperbolic geometry","score":0.3425000011920929},{"id":"https://openalex.org/keywords/hyperbolic-triangle","display_name":"Hyperbolic triangle","score":0.3301999866962433}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6823999881744385},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5674999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4968999922275543},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47929999232292175},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38510000705718994},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C16140857","wikidata":"https://www.wikidata.org/wiki/Q945953","display_name":"Gaussian curvature","level":3,"score":0.36010000109672546},{"id":"https://openalex.org/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.3425000011920929},{"id":"https://openalex.org/C82673646","wikidata":"https://www.wikidata.org/wiki/Q2246553","display_name":"Hyperbolic triangle","level":4,"score":0.3301999866962433},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3197999894618988},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2996000051498413},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/3604","is_oa":false,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Geometry; Vol. 12 No. 2: Special Issue of Selected Papers from SoCG 2020; 25\u201354","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.20382/jocg.v12i2a3","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v12i2a3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"article-journal"}],"best_oa_location":{"id":"doi:10.20382/jocg.v12i2a3","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v12i2a3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"article-journal"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4899681806564331}],"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],"study":[1],"the":[2,7,17],"traveling":[3],"salesman":[4],"problem":[5],"in":[6],"hyperbolic":[8,43],"plane":[9],"of":[10,74,82,92],"Gaussian":[11],"curvature":[12],"$-1$.":[13],"Let":[14],"$\\alpha$":[15,50,63],"denote":[16],"minimum":[18],"distance":[19],"between":[20],"any":[21],"two":[22],"input":[23],"points.":[24],"Using":[25],"a":[26,31,79,89],"new":[27,32],"separator":[28],"theorem":[29],"and":[30,57],"rerouting":[33],"argument,":[34],"we":[35,76],"give":[36],"an":[37],"$n^{O(log^2":[38],"n)":[39],"\\max(1,1/\\alpha)}$":[40],"algorithm":[41,81],"for":[42],"TSP.":[44],"This":[45],"is":[46,51],"quasi-polynomial":[47],"time":[48,91],"if":[49],"at":[52],"least":[53],"some":[54],"absolute":[55],"constant,":[56],"it":[58],"grows":[59],"to":[60,65],"$n^{O(\\sqrt{n})|":[61],"as":[62],"decreases":[64],"$\\log^2":[66],"n":[67],"/":[68],"\\sqrt{n}$.":[69],"(For":[70],"even":[71],"smaller":[72],"values":[73],"$\\alpha$,":[75],"can":[77],"use":[78],"planarity-based":[80],"Hwang":[83],"et":[84],"al.":[85],"(1993),":[86],"which":[87],"gives":[88],"running":[90],"$n^{O(\\sqrt{n})}$.)":[93]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}