{"id":"https://openalex.org/W4313407184","doi":"https://doi.org/10.1007/978-3-031-22543-7_6","title":"Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a\u00a0Constant Ratio","display_name":"Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a\u00a0Constant Ratio","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4313407184","doi":"https://doi.org/10.1007/978-3-031-22543-7_6"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-22543-7_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-22543-7_6","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/A5050865451","display_name":"Michael Khachay","orcid":"https://orcid.org/0000-0003-3555-0080"},"institutions":[{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Michael Khachay","raw_affiliation_strings":["Krasovskii Institute of Mathematics and Mechanics, Ekaterinburg, Russia","Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia"],"raw_orcid":"https://orcid.org/0000-0003-3555-0080","affiliations":[{"raw_affiliation_string":"Krasovskii Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083360366","display_name":"Katherine Neznakhina","orcid":"https://orcid.org/0000-0002-2122-0446"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]},{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Katherine Neznakhina","raw_affiliation_strings":["Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","Ural Federal University, Ekaterinburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-2122-0446","affiliations":[{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Ural Federal University, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066075360","display_name":"Ksenia Rizhenko","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Ksenia Rizhenko","raw_affiliation_strings":["Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia"],"raw_orcid":"https://orcid.org/0000-0001-7508-4833","affiliations":[{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050865451"],"corresponding_institution_ids":["https://openalex.org/I4210105350"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30376054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"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.9955000281333923,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9873999953269958,"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.9547130465507507},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.7567660808563232},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.6500542759895325},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6271186470985413},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6255066990852356},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.546198308467865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5055868625640869},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5018234252929688},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.479576051235199},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.47904813289642334},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42349621653556824},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.411124050617218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4025845527648926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3576192259788513}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9547130465507507},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.7567660808563232},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.6500542759895325},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6271186470985413},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6255066990852356},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.546198308467865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5055868625640869},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5018234252929688},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.479576051235199},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.47904813289642334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42349621653556824},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.411124050617218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4025845527648926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3576192259788513},{"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.1007/978-3-031-22543-7_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-22543-7_6","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1571087346","https://openalex.org/W1986056047","https://openalex.org/W1986334784","https://openalex.org/W2001139415","https://openalex.org/W2022236762","https://openalex.org/W2044119054","https://openalex.org/W2053074164","https://openalex.org/W2055569927","https://openalex.org/W2077694070","https://openalex.org/W2086917808","https://openalex.org/W2123087902","https://openalex.org/W2140071288","https://openalex.org/W2167374893","https://openalex.org/W2470965158","https://openalex.org/W2745594004","https://openalex.org/W2963418968","https://openalex.org/W2998709212","https://openalex.org/W3021630734","https://openalex.org/W3032947628","https://openalex.org/W3035464720","https://openalex.org/W3102266534","https://openalex.org/W4237504351","https://openalex.org/W4250280589","https://openalex.org/W4255986054","https://openalex.org/W4315557040"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4220987199","https://openalex.org/W1595757466","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2766731260","https://openalex.org/W2033851048","https://openalex.org/W4200179302","https://openalex.org/W2038858023","https://openalex.org/W1996380018"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}