{"id":"https://openalex.org/W1963530117","doi":"https://doi.org/10.1016/0020-0190(89)90072-0","title":"An approximation algorithm for the TSP","display_name":"An approximation algorithm for the TSP","publication_year":1989,"publication_date":"1989-04-01","ids":{"openalex":"https://openalex.org/W1963530117","doi":"https://doi.org/10.1016/0020-0190(89)90072-0","mag":"1963530117"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(89)90072-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90072-0","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5040058398","display_name":"Josep M. Basart","orcid":"https://orcid.org/0000-0002-2700-3901"},"institutions":[{"id":"https://openalex.org/I123044942","display_name":"Universitat Aut\u00f2noma de Barcelona","ror":"https://ror.org/052g8jq94","country_code":"ES","type":"education","lineage":["https://openalex.org/I123044942"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"J.M. Basart","raw_affiliation_strings":["Departament d'Inform\u00e0tica, Facultat de Ci\u00e8ncies, Universitat Aut\u00f2noma de Barcelona, 08193 Bellaterra, Catalunya, Spain"],"affiliations":[{"raw_affiliation_string":"Departament d'Inform\u00e0tica, Facultat de Ci\u00e8ncies, Universitat Aut\u00f2noma de Barcelona, 08193 Bellaterra, Catalunya, Spain","institution_ids":["https://openalex.org/I123044942"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113894054","display_name":"L. Huguet","orcid":null},"institutions":[{"id":"https://openalex.org/I123044942","display_name":"Universitat Aut\u00f2noma de Barcelona","ror":"https://ror.org/052g8jq94","country_code":"ES","type":"education","lineage":["https://openalex.org/I123044942"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"L. Huguet","raw_affiliation_strings":["Departament d'Inform\u00e0tica, Facultat de Ci\u00e8ncies, Universitat Aut\u00f2noma de Barcelona, 08193 Bellaterra, Catalunya, Spain"],"affiliations":[{"raw_affiliation_string":"Departament d'Inform\u00e0tica, Facultat de Ci\u00e8ncies, Universitat Aut\u00f2noma de Barcelona, 08193 Bellaterra, Catalunya, Spain","institution_ids":["https://openalex.org/I123044942"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040058398"],"corresponding_institution_ids":["https://openalex.org/I123044942"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.16120815,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"2","first_page":"77","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7668008208274841},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6925668716430664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5831398367881775},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5613951683044434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5127357244491577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49823808670043945},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4475998878479004},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4438454806804657},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43808242678642273},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43398475646972656},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41104185581207275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3975068926811218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21167340874671936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15298843383789062}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7668008208274841},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6925668716430664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5831398367881775},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5613951683044434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5127357244491577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49823808670043945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4475998878479004},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4438454806804657},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43808242678642273},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43398475646972656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41104185581207275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3975068926811218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21167340874671936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15298843383789062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(89)90072-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90072-0","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2117226423","https://openalex.org/W2169528473","https://openalex.org/W2279353332","https://openalex.org/W2613051710","https://openalex.org/W4251316462","https://openalex.org/W4302399279","https://openalex.org/W6677426919","https://openalex.org/W7056727752"],"related_works":["https://openalex.org/W4297427155","https://openalex.org/W3136451934","https://openalex.org/W3025823153","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}