{"id":"https://openalex.org/W2113529358","doi":"https://doi.org/10.1007/s004530010071","title":"Algorithms for the On-Line Travelling Salesman1","display_name":"Algorithms for the On-Line Travelling Salesman1","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W2113529358","doi":"https://doi.org/10.1007/s004530010071","mag":"2113529358"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010071","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010071","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5102716483","display_name":"Giorgio Ausiello","orcid":"https://orcid.org/0000-0003-1345-5007"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. Ausiello","raw_affiliation_strings":["University of Rome \u201cLa Sapienza \u201d"],"affiliations":[{"raw_affiliation_string":"University of Rome \u201cLa Sapienza \u201d","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087882065","display_name":"Esteban Feuerstein","orcid":"https://orcid.org/0000-0003-2985-810X"},"institutions":[{"id":"https://openalex.org/I53241121","display_name":"Fundaci\u00f3n Ciencias Exactas y Naturales","ror":"https://ror.org/05rxmkq09","country_code":"AR","type":"nonprofit","lineage":["https://openalex.org/I53241121"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"E. Feuerstein","raw_affiliation_strings":["Departamento de Computaci\u00f3n, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabell\u00f3n I, Ciudad Universitaria, 1428 Buenos Aires, Argentina, and Instituto de Ciencias, Universidad de General Sarmiento, Rxa 850, (1663) San Miguel, Buenos Aires, Argentina. esteban@dc.uba.ar. Partly supported by the KIT program of the European Community under Contract No. 131 (DYNDATA) and by UBA's ``Programaci\u00f3n para Investigadores J\u00f3venes'' project ``Algoritmos eficientes para problemas on-line con aplicaciones''. , AR","Fundaci\u00f3n Ciencias Exactas y Naturales, Buenos Aires, Argentina"],"affiliations":[{"raw_affiliation_string":"Departamento de Computaci\u00f3n, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabell\u00f3n I, Ciudad Universitaria, 1428 Buenos Aires, Argentina, and Instituto de Ciencias, Universidad de General Sarmiento, Rxa 850, (1663) San Miguel, Buenos Aires, Argentina. esteban@dc.uba.ar. Partly supported by the KIT program of the European Community under Contract No. 131 (DYNDATA) and by UBA's ``Programaci\u00f3n para Investigadores J\u00f3venes'' project ``Algoritmos eficientes para problemas on-line con aplicaciones''. , AR","institution_ids":["https://openalex.org/I53241121"]},{"raw_affiliation_string":"Fundaci\u00f3n Ciencias Exactas y Naturales, Buenos Aires, Argentina","institution_ids":["https://openalex.org/I53241121"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Leonardi","raw_affiliation_strings":["Computer, Control and Management Engineering Antonio Ruberti"],"affiliations":[{"raw_affiliation_string":"Computer, Control and Management Engineering Antonio Ruberti","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044184077","display_name":"Leen Stougie","orcid":"https://orcid.org/0000-0001-6938-8902"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"L. Stougie","raw_affiliation_strings":["Department of Mathematics, Eindhoven University of Technology, PO Box 513, 5600MB Eindhoven, The Netherlands. leen@win.tue.nl. Supported by the Human Capital Mobility Network DONET of the European Community., NL"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Eindhoven University of Technology, PO Box 513, 5600MB Eindhoven, The Netherlands. leen@win.tue.nl. Supported by the Human Capital Mobility Network DONET of the European Community., NL","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077567390","display_name":"Maurizio Talamo","orcid":"https://orcid.org/0000-0002-3888-0889"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Talamo","raw_affiliation_strings":["University of Rome \u201cLa Sapienza \u201d"],"affiliations":[{"raw_affiliation_string":"University of Rome \u201cLa Sapienza \u201d","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5102716483"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":9.371,"has_fulltext":false,"cited_by_count":165,"citation_normalized_percentile":{"value":0.98102483,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"29","issue":"4","first_page":"560","last_page":"581"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9925000071525574,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.8472195863723755},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.6941249370574951},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6781085729598999},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6713564991950989},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6673780679702759},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.6401344537734985},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5524418354034424},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4932803511619568},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4899365305900574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48638203740119934},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4840618669986725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4741087555885315},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4729565978050232},{"id":"https://openalex.org/keywords/real-line","display_name":"Real line","score":0.4714430570602417},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43995577096939087},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.42486798763275146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3899575471878052},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3821527063846588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3710106611251831},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2612135112285614},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24584046006202698},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.1379745602607727}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8472195863723755},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.6941249370574951},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6781085729598999},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6713564991950989},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6673780679702759},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.6401344537734985},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5524418354034424},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4932803511619568},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4899365305900574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48638203740119934},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4840618669986725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4741087555885315},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4729565978050232},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.4714430570602417},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43995577096939087},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.42486798763275146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3899575471878052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3821527063846588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3710106611251831},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2612135112285614},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24584046006202698},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.1379745602607727},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s004530010071","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010071","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/b0a34046-9d76-4d15-b014-57615a3a50ee","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/b0a34046-9d76-4d15-b014-57615a3a50ee","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":"Ausiello, G, Feuerstein, E, Leonardi, S, Stougie, L & Talamo, M 2001, 'Algorithms for the on-line travelling salesman', Algorithmica, vol. 29, no. 4, pp. 560-581. https://doi.org/10.1007/s004530010071","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:iris.uniroma1.it:11573/255261","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/255261","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/12ceb933-45d2-4e95-9d8c-7fe0a9f8f983","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/12ceb933-45d2-4e95-9d8c-7fe0a9f8f983","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":""},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/001d70e3-9426-4eaf-9f53-add1f5d0c623","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/001d70e3-9426-4eaf-9f53-add1f5d0c623","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":"Ausiello, G, Feuerstein, E, Leonardi, S, Stougie, L & Talamo, M 2001, 'Algorithms for the on-line travelling salesman', Algorithmica, vol. 29, no. 4, pp. 560-581. https://doi.org/10.1007/s004530010071","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b0a34046-9d76-4d15-b014-57615a3a50ee","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/b0a34046-9d76-4d15-b014-57615a3a50ee","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":"Algorithmica, 29(4), 560 - 581. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:vu:oai:research.vu.nl:publications/001d70e3-9426-4eaf-9f53-add1f5d0c623","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/001d70e3-9426-4eaf-9f53-add1f5d0c623","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":"Algorithmica, 29(4), 560 - 581. Springer New York","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1586272073","https://openalex.org/W1594646153","https://openalex.org/W1595545560","https://openalex.org/W1985351788","https://openalex.org/W2011039300","https://openalex.org/W2041645394","https://openalex.org/W2056760235","https://openalex.org/W2072400378","https://openalex.org/W2073083283","https://openalex.org/W2073682860","https://openalex.org/W2078969731","https://openalex.org/W2082099352","https://openalex.org/W2085799273","https://openalex.org/W2089269509","https://openalex.org/W2096305430","https://openalex.org/W2129754251","https://openalex.org/W2130055503","https://openalex.org/W2143987816","https://openalex.org/W2160509725","https://openalex.org/W2611491551","https://openalex.org/W4210959501"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2025867747","https://openalex.org/W3194414553"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}