{"id":"https://openalex.org/W3138698442","doi":"https://doi.org/10.1007/s00454-011-9337-9","title":"A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics","display_name":"A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics","publication_year":2011,"publication_date":"2011-03-17","ids":{"openalex":"https://openalex.org/W3138698442","doi":"https://doi.org/10.1007/s00454-011-9337-9","mag":"3138698442"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-011-9337-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-011-9337-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-011-9337-9.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-011-9337-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018708584","display_name":"T-H. Hubert Chan","orcid":"https://orcid.org/0000-0002-8340-235X"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"T.-H. Hubert Chan","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000070192","display_name":"Khaled Elbassioni","orcid":"https://orcid.org/0000-0001-7021-5400"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Khaled Elbassioni","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018708584"],"corresponding_institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.2854,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.81840105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"46","issue":"4","first_page":"704","last_page":"723"},"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.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8348276615142822},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.763908326625824},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7452211380004883},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.699196457862854},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5595147609710693},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5468189716339111},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.48300063610076904},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4447418749332428},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4436797499656677},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4310925006866455},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42798614501953125},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42123815417289734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.08962300419807434}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8348276615142822},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.763908326625824},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7452211380004883},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.699196457862854},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5595147609710693},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5468189716339111},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.48300063610076904},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4447418749332428},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4436797499656677},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4310925006866455},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42798614501953125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42123815417289734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.08962300419807434},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00454-011-9337-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-011-9337-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-011-9337-9.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:edoc.mpg.de:618726","is_oa":true,"landing_page_url":"http://edoc.mpg.de/618726","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete & Computational Geometry, v.46, 704-723 (2011)","raw_type":"Article"},{"id":"pmh:oai:hub.hku.hk:10722/144883","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/144883","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s00454-011-9337-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-011-9337-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-011-9337-9.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3138698442.pdf","grobid_xml":"https://content.openalex.org/works/W3138698442.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W77772846","https://openalex.org/W100489996","https://openalex.org/W117968063","https://openalex.org/W1492170047","https://openalex.org/W1500667496","https://openalex.org/W1524136787","https://openalex.org/W1533818411","https://openalex.org/W1968165428","https://openalex.org/W1983067644","https://openalex.org/W1991755800","https://openalex.org/W1994248285","https://openalex.org/W1994772769","https://openalex.org/W1997900197","https://openalex.org/W2020284736","https://openalex.org/W2034188144","https://openalex.org/W2047747795","https://openalex.org/W2053578961","https://openalex.org/W2054575839","https://openalex.org/W2079010364","https://openalex.org/W2079896400","https://openalex.org/W2091221928","https://openalex.org/W2107342718","https://openalex.org/W2110824994","https://openalex.org/W2113076619","https://openalex.org/W2114493937","https://openalex.org/W2127248062","https://openalex.org/W2141791003","https://openalex.org/W2145128369","https://openalex.org/W2158907148","https://openalex.org/W2167816765","https://openalex.org/W2295961103","https://openalex.org/W2583644876","https://openalex.org/W2610052675","https://openalex.org/W2626123884","https://openalex.org/W3030774092","https://openalex.org/W3121675905"],"related_works":["https://openalex.org/W2161182859","https://openalex.org/W2118320476","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W1987064509","https://openalex.org/W3211864880","https://openalex.org/W4231169019","https://openalex.org/W2591753903"],"abstract_inverted_index":{"We":[0,37,160],"consider":[1],"the":[2,33,46,58,80,95,125,134,145,172,181,185],"Traveling":[3],"Salesman":[4],"Problem":[5,176],"with":[6,180],"Neighborhoods":[7],"(TSPN)":[8],"in":[9,32,92],"doubling":[10,150,178],"metrics.":[11],"The":[12],"goal":[13],"is":[14],"to":[15,74,168],"find":[16],"a":[17,24,39,86,110,169],"shortest":[18],"tour":[19],"that":[20,113,163],"visits":[21],"each":[22,93,105],"of":[23,26,61,89],"collection":[25],"n":[27],"subsets":[28],"(regions":[29],"or":[30],"neighborhoods)":[31],"underlying":[34],"metric":[35,77],"space.":[36,78],"give":[38],"quasi-polynomial":[40],"time":[41,127],"approximation":[42,128],"scheme":[43,129],"(QPTAS)":[44],"when":[45],"regions":[47,81,96],"are":[48,116],"what":[49],"we":[50],"call":[51],"\u03b1-fat":[52],"weakly":[53],"disjoint.":[54],"This":[55],"notion":[56],"combines":[57],"existing":[59],"notions":[60,73],"diameter":[62],"variation,":[63],"fatness":[64],"and":[65,70,104,144],"disjointness":[66],"for":[67,101,131,147,171],"geometric":[68],"objects":[69],"generalizes":[71,124],"these":[72,114],"any":[75],"arbitrary":[76],"Intuitively,":[79],"can":[82,108],"be":[83],"grouped":[84],"into":[85],"bounded":[87],"number":[88],"types,":[90],"where":[91],"type,":[94],"have":[97],"similar":[98],"upper":[99],"bounds":[100],"their":[102],"diameters,":[103],"such":[106,112],"region":[107],"designate":[109],"point":[111],"points":[115],"far":[117],"away":[118],"from":[119],"one":[120],"another.":[121],"Our":[122],"result":[123],"polynomial":[126],"(PTAS)":[130],"TSPN":[132],"on":[133,149,177,184],"Euclidean":[135],"plane":[136],"by":[137,152],"Mitchell":[138],"(in":[139,154],"SODA,":[140],"pp.":[141,157],"11\u201318,":[142],"2007)":[143],"QPTAS":[146,170],"TSP":[148],"metrics":[151],"Talwar":[153],"36th":[155],"STOC,":[156],"281\u2013290,":[158],"2004).":[159],"also":[161],"observe":[162],"our":[164],"techniques":[165],"directly":[166],"extend":[167],"Group":[173],"Steiner":[174],"Tree":[175],"metrics,":[179],"same":[182],"assumption":[183],"groups.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}