{"id":"https://openalex.org/W1492170047","doi":"https://doi.org/10.1007/11523468_90","title":"Approximation Algorithms for Euclidean Group TSP","display_name":"Approximation Algorithms for Euclidean Group TSP","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1492170047","doi":"https://doi.org/10.1007/11523468_90","mag":"1492170047"},"language":"en","primary_location":{"id":"doi:10.1007/11523468_90","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11523468_90","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005932160","display_name":"Aleksei V. Fishkin","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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":"Aleksei V. Fishkin","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051793571","display_name":"Nabil H. Mustafa","orcid":"https://orcid.org/0000-0003-1046-6157"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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":"Nabil H. Mustafa","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"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/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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":"Ren\u00e9 Sitters","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.613,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.977799,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1115","last_page":"1126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.698199987411499,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.698199987411499,"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/group","display_name":"Group (periodic table)","score":0.5277358293533325},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5187944769859314},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47603562474250793},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44364607334136963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4406549632549286},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.42790722846984863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4275453984737396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42105424404144287},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.287982314825058},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12491697072982788},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09876194596290588}],"concepts":[{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5277358293533325},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5187944769859314},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47603562474250793},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44364607334136963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4406549632549286},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.42790722846984863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4275453984737396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42105424404144287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.287982314825058},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12491697072982788},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09876194596290588},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/11523468_90","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11523468_90","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/087e92d6-82a7-4115-bb62-97340e9d298c","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/087e92d6-82a7-4115-bb62-97340e9d298c","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, Mustafa, N H & Sitters, R A 2005, Approximation algorithms for Euclidean group TSP. in L Caires, G F Italiano, L Monteiro, C Palamidessi & M Yung (eds), Automata, languages and programming : 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. : proceedings. Lecture Notes in Computer Science, vol. 3580, Springer, Berlin, pp. 1115-1126. https://doi.org/10.1007/11523468_90","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/e05fde82-354c-474f-9f0e-de79594ba0b4","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/e05fde82-354c-474f-9f0e-de79594ba0b4","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, Fishkin, A V, Mustafa, N H & Sitters, R 2005, 'Approximation algorithms for Euclidean group TSP', Lecture Notes in Computer Science, vol. 3580, pp. 1115-1126.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.1753","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~elbassio/pub/gtsp.pdf","raw_type":"text"},{"id":"pmh:659663","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=659663","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":"","raw_type":null},{"id":"pmh:oai:pure.mpg.de:item_1328809","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-25C3-C","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:research.vu.nl:publications/e05fde82-354c-474f-9f0e-de79594ba0b4","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/e05fde82-354c-474f-9f0e-de79594ba0b4","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, Fishkin, A V, Mustafa, N H & Sitters, R 2005, 'Approximation algorithms for Euclidean group TSP', Lecture Notes in Computer Science, vol. 3580, pp. 1115-1126.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:659663","is_oa":false,"landing_page_url":"http://repository.tue.nl/659663","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":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:pure.tue.nl:publications/087e92d6-82a7-4115-bb62-97340e9d298c","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/087e92d6-82a7-4115-bb62-97340e9d298c","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":"Automata, languages and programming : 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. : proceedings, 1115 - 1126","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"mag:1492170047","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1328809","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1550030874","https://openalex.org/W1559701472","https://openalex.org/W1591968161","https://openalex.org/W1831187993","https://openalex.org/W1968165428","https://openalex.org/W1969665089","https://openalex.org/W1994248285","https://openalex.org/W2055569927","https://openalex.org/W2066194644","https://openalex.org/W2079010364","https://openalex.org/W2110824994","https://openalex.org/W2165142526","https://openalex.org/W2610052675","https://openalex.org/W3121675905"],"related_works":["https://openalex.org/W2110824994","https://openalex.org/W2047747795","https://openalex.org/W1524136787","https://openalex.org/W2141791003","https://openalex.org/W2054575839","https://openalex.org/W2168990813","https://openalex.org/W1968165428","https://openalex.org/W2011039300","https://openalex.org/W1994248285","https://openalex.org/W2165142526","https://openalex.org/W2055569927","https://openalex.org/W2020284736","https://openalex.org/W1559701472","https://openalex.org/W1544478599","https://openalex.org/W2117257995","https://openalex.org/W1992370839","https://openalex.org/W1591968161","https://openalex.org/W2313274380","https://openalex.org/W2295961103","https://openalex.org/W1997900197"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-08-19T15:00:24.278416","created_date":"2025-10-10T00:00:00"}