{"id":"https://openalex.org/W7163915483","doi":"https://doi.org/10.4230/lipics.swat.2026.18","title":"On Fr\u00e9chet Traveling Salesmen Problems","display_name":"On Fr\u00e9chet Traveling Salesmen Problems","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163915483","doi":"https://doi.org/10.4230/lipics.swat.2026.18"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26054","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.18","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.18/LIPIcs.SWAT.2026.18.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.18/LIPIcs.SWAT.2026.18.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007090107","display_name":"Omrit Filtser","orcid":"https://orcid.org/0000-0002-3978-1428"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Filtser, Omrit","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel"],"raw_orcid":"https://orcid.org/0000-0002-3978-1428","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033078782","display_name":"Tzalik Maimon","orcid":null},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Maimon, Tzalik","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel"],"raw_orcid":"https://orcid.org/0009-0000-8459-8553","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137664822","display_name":"Michal Moiseev","orcid":null},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moiseev, Michal","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel"],"raw_orcid":"https://orcid.org/0009-0006-8716-3233","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.92562487,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6079999804496765,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6079999804496765,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.09319999814033508,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.09229999780654907,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6577000021934509},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5939000248908997},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5873000025749207},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5871000289916992},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.3882000148296356}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6577000021934509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6029000282287598},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5939000248908997},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5873000025749207},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5871000289916992},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5601000189781189},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3882000148296356},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3321000039577484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.329800009727478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3156999945640564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2793000042438507},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.2696000039577484},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26054","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.18","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.18/LIPIcs.SWAT.2026.18.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.18","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26054","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.18","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.18/LIPIcs.SWAT.2026.18.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"score":0.5961944460868835,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163915483.pdf","grobid_xml":"https://content.openalex.org/works/W7163915483.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Fr\u00e9chet":[1,20,88,136,173],"distance":[2,6,21,89],"is":[3,69,93,168],"a":[4,28,37,46,78,105,127],"well-studied":[5],"measure":[7],"between":[8,90],"two":[9,40,72],"curves.":[10],"In":[11,60],"this":[12,61,131],"work,":[13],"we":[14,63,163],"demonstrate":[15],"that":[16,86,165],"the":[17,67,84,87,91,108,134,143,147,150,154,166,171],"merit":[18],"of":[19,49,81,107,117,142,149,156],"extends":[22],"beyond":[23],"evaluating":[24],"similarity,":[25],"and":[26,113,123,138,152],"introduce":[27],"new":[29],"setting":[30],"in":[31,119],"which":[32],"it":[33],"proves":[34],"useful.":[35],"Consider":[36],"situation":[38],"where":[39,66],"agents":[41],"are":[42,76],"required":[43],"to":[44,54,70,159],"visit":[45],"given":[47,79],"set":[48,80],"sites,":[50],"while":[51],"staying":[52],"close":[53],"each":[55,160],"other":[56],"throughout":[57],"their":[58],"traversal.":[59],"paper,":[62],"study":[64],"problems":[65],"goal":[68],"construct":[71],"curves":[73,92,151],"whose":[74],"vertices":[75],"from":[77],"points,":[82],"under":[83,133,170],"constraint":[85],"kept":[94],"as":[95,97,104],"small":[96],"possible.":[98],"This":[99],"problem":[100,132,167],"can":[101],"be":[102,116],"viewed":[103],"variant":[106],"Traveling":[109],"Salesman":[110],"Problem":[111],"(TSP),":[112],"thus":[114],"may":[115],"interest":[118],"routing,":[120],"network":[121],"planning":[122],"more.":[124],"We":[125],"present":[126],"near-linear":[128],"algorithm":[129],"for":[130],"discrete":[135],"distance,":[137],"explore":[139],"several":[140],"variants":[141],"problem,":[144],"including":[145],"minimizing":[146],"lengths":[148],"balancing":[153],"number":[155],"sites":[157],"assigned":[158],"agent.":[161],"Lastly,":[162],"prove":[164],"NP-hard":[169],"continuous":[172],"Distance.":[174]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}