{"id":"https://openalex.org/W2021625223","doi":"https://doi.org/10.1016/0020-0190(92)90103-3","title":"An approximation algorithm for the asymmetric travelling salesman problem with distances one and two","display_name":"An approximation algorithm for the asymmetric travelling salesman problem with distances one and two","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W2021625223","doi":"https://doi.org/10.1016/0020-0190(92)90103-3","mag":"2021625223"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(92)90103-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90103-3","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/A5053966865","display_name":"Sundar Vishwanathan","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sundar Vishwanathan","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL 60637, USA","Department of Computer Science, University of Chicago, Chicago, IL, 60637, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL 60637, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL, 60637, USA","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053966865"],"corresponding_institution_ids":["https://openalex.org/I40347166"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.0299,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.77900214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"44","issue":"6","first_page":"297","last_page":"302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9890000224113464,"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.9016255140304565},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6799321174621582},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.6356302499771118},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6249998807907104},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6089917421340942},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5678102374076843},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5552684664726257},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5251093506813049},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5219918489456177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40366578102111816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3244166374206543},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15203383564949036}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9016255140304565},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6799321174621582},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.6356302499771118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6249998807907104},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6089917421340942},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5678102374076843},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5552684664726257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5251093506813049},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5219918489456177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40366578102111816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3244166374206543},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15203383564949036}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(92)90103-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90103-3","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W285996787","https://openalex.org/W2011039300","https://openalex.org/W2019063045","https://openalex.org/W2022179164","https://openalex.org/W2034350206","https://openalex.org/W2035610952","https://openalex.org/W2052162800","https://openalex.org/W2053913299","https://openalex.org/W2062749672","https://openalex.org/W2066356146","https://openalex.org/W2069323107","https://openalex.org/W2075920437","https://openalex.org/W2117226423","https://openalex.org/W2143391442","https://openalex.org/W2401610261","https://openalex.org/W2956015669","https://openalex.org/W6644040475","https://openalex.org/W6677426919","https://openalex.org/W6681300758"],"related_works":["https://openalex.org/W1595757466","https://openalex.org/W2766731260","https://openalex.org/W1149738984","https://openalex.org/W4301419164","https://openalex.org/W2052817264","https://openalex.org/W2187742086","https://openalex.org/W4298199106","https://openalex.org/W2371942036","https://openalex.org/W2625012311","https://openalex.org/W2734875663"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}