{"id":"https://openalex.org/W2113076619","doi":"https://doi.org/10.1142/s0218195909002897","title":"APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS","display_name":"APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2113076619","doi":"https://doi.org/10.1142/s0218195909002897","mag":"2113076619"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195909002897","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195909002897","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","Max-Planck-Institut fur Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrucken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut fur Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrucken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005932160","display_name":"Aleksei V. Fishkin","orcid":null},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ALEKSEI V. FISHKIN","raw_affiliation_strings":["Siemens AG, Corporate Technology, Discrete Optimization, Otto-Hahn-Ring 6, 81739 M\u00fcnchen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Siemens AG, Corporate Technology, Discrete Optimization, Otto-Hahn-Ring 6, 81739 M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I1325886976"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047920456","display_name":"Ren\u00e9 Sitters","orcid":"https://orcid.org/0000-0002-0385-0794"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"REN\u00c9 SITTERS","raw_affiliation_strings":["Econometrics and Operations Research, the VU University, Amsterdam, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Econometrics and Operations Research, the VU University, Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6915,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.95474712,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"02","first_page":"173","last_page":"193"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8786650896072388},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7428737282752991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7267864942550659},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6645132899284363},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.593239963054657},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5735360980033875},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5569354891777039},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4999537467956543},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46610841155052185},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.46283817291259766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43751439452171326},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4290994703769684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17696574330329895},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10148999094963074}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8786650896072388},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7428737282752991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7267864942550659},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6645132899284363},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.593239963054657},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5735360980033875},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5569354891777039},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4999537467956543},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46610841155052185},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.46283817291259766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43751439452171326},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4290994703769684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17696574330329895},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10148999094963074},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1142/s0218195909002897","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195909002897","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/e327c292-96d2-4dda-a6e8-97cde8dddedc","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e327c292-96d2-4dda-a6e8-97cde8dddedc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Elbassioni, K M, Fishkin, A V & Sitters, R A 2009, 'Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods', International Journal of Computational Geometry and Applications, vol. 19, no. 2, pp. 173-193. https://doi.org/10.1142/S0218195909002897","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research.vu.nl:publications/ff30d770-44db-4536-b143-dab5de48740b","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/ff30d770-44db-4536-b143-dab5de48740b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Elbassioni, K M, Fishkin, A V & Sitters, R A 2009, 'Approximation algorithms for Euclidean group TSP and TSP with neighborhoods', International Journal of Computational Geometry and Applications, vol. 19, pp. 173-193. https://doi.org/10.1142/S0218195909002897","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.9891","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.9891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~elbassio/pub/gtsp-jor2.pdf","raw_type":"text"},{"id":"pmh:648364","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=648364","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0218-1959","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:648364","is_oa":false,"landing_page_url":"http://repository.tue.nl/648364","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0218-1959","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/ff30d770-44db-4536-b143-dab5de48740b","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/ff30d770-44db-4536-b143-dab5de48740b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Elbassioni, K M, Fishkin, A V & Sitters, R A 2009, 'Approximation algorithms for Euclidean group TSP and TSP with neighborhoods', International Journal of Computational Geometry and Applications, vol. 19, pp. 173-193. https://doi.org/10.1142/S0218195909002897","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e327c292-96d2-4dda-a6e8-97cde8dddedc","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e327c292-96d2-4dda-a6e8-97cde8dddedc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry and Applications, 19(2), 173 - 193. World Scientific","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1492170047","https://openalex.org/W1500667496","https://openalex.org/W1524136787","https://openalex.org/W1544478599","https://openalex.org/W1550030874","https://openalex.org/W1559701472","https://openalex.org/W1591968161","https://openalex.org/W1968165428","https://openalex.org/W1994248285","https://openalex.org/W2047747795","https://openalex.org/W2054575839","https://openalex.org/W2082353536","https://openalex.org/W2094548115","https://openalex.org/W2110824994","https://openalex.org/W2171554063","https://openalex.org/W2295961103","https://openalex.org/W2610052675","https://openalex.org/W3121675905","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4286986030","https://openalex.org/W1513989689","https://openalex.org/W2413690630","https://openalex.org/W1992370839","https://openalex.org/W2113076619","https://openalex.org/W3121675905","https://openalex.org/W2145128369","https://openalex.org/W2950645708","https://openalex.org/W2137812761","https://openalex.org/W2017319551"],"abstract_inverted_index":{"In":[0],"the":[1,18,61,64,92,98],"Euclidean":[2],"traveling":[3],"salesman":[4],"problem":[5],"with":[6,70,84,94],"discrete":[7],"neighborhoods,":[8,96],"we":[9],"are":[10,66,130],"given":[11],"a":[12,21,40,113],"set":[13,22],"of":[14,23,34,42,127],"points":[15],"P":[16],"in":[17,51],"plane":[19],"and":[20,68,133],"n":[24],"connected":[25],"regions":[26,65,83],"(neighborhoods),":[27],"each":[28,52,104],"containing":[29],"at":[30,47,106],"least":[31,48],"one":[32,49],"point":[33,50],"P.":[35],"We":[36,54,109],"seek":[37],"to":[38,91],"find":[39],"tour":[41,101],"minimum":[43],"length":[44],"which":[45],"visits":[46],"region.":[53],"give":[55,111],"(i)":[56],"an":[57,75],"O(\u03b1)-approximation":[58],"algorithm":[59,79,118],"for":[60,80,119],"case":[62,93],"when":[63],"disjoint":[67],"\u03b1-fat,":[69],"possibly":[71],"varying":[72],"size;":[73],"(ii)":[74],"O(\u03b1":[76],"3":[77],")-approximation":[78],"intersecting":[81],"\u03b1-fat":[82],"comparable":[85],"diameters.":[86],"These":[87],"results":[88],"also":[89,110],"apply":[90],"continuous":[95,120],"where":[97],"sought":[99],"TSP":[100],"can":[102],"hit":[103],"region":[105],"any":[107],"point.":[108],"(iii)":[112],"simple":[114],"O(":[115],"log":[116],"n)-approximation":[117],"non-fat":[121],"neighborhoods.":[122],"The":[123],"most":[124],"distinguishing":[125],"features":[126],"these":[128],"algorithms":[129],"their":[131],"simplicity":[132],"low":[134],"running-time":[135],"complexities.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}