{"id":"https://openalex.org/W3001918660","doi":"https://doi.org/10.1007/978-3-030-38629-0_16","title":"Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs","display_name":"Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3001918660","doi":"https://doi.org/10.1007/978-3-030-38629-0_16","mag":"3001918660"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-38629-0_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-38629-0_16","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":"book-chapter","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/A5045554700","display_name":"\u00c8. Kh. Gimadi","orcid":"https://orcid.org/0000-0002-1349-405X"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Edward Kh. Gimadi","raw_affiliation_strings":["Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russia","Sobolev Institute of Mathematics, Novosibirsk, Russia"],"raw_orcid":"https://orcid.org/0000-0002-1349-405X","affiliations":[{"raw_affiliation_string":"Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russia","institution_ids":["https://openalex.org/I188973947"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210096862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052978393","display_name":"Oxana Yu. Tsidulko","orcid":"https://orcid.org/0000-0001-9570-8519"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Oxana Tsidulko","raw_affiliation_strings":["Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russia","Sobolev Institute of Mathematics, Novosibirsk, Russia"],"raw_orcid":"https://orcid.org/0000-0001-9570-8519","affiliations":[{"raw_affiliation_string":"Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russia","institution_ids":["https://openalex.org/I188973947"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210096862"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045554700"],"corresponding_institution_ids":["https://openalex.org/I188973947","https://openalex.org/I4210096862"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1461,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74626377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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":0.9995999932289124,"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.9973000288009644,"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/T11106","display_name":"Data Management and Algorithms","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9476721286773682},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6537564396858215},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6455440521240234},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.6099605560302734},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5903369188308716},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5764153003692627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5399858951568604},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5396684408187866},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5176509022712708},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41092365980148315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39393317699432373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32883644104003906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3228459358215332},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21292179822921753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11170479655265808},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10780563950538635}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9476721286773682},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6537564396858215},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6455440521240234},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.6099605560302734},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5903369188308716},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5764153003692627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5399858951568604},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5396684408187866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5176509022712708},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41092365980148315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39393317699432373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32883644104003906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3228459358215332},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21292179822921753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11170479655265808},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10780563950538635}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-38629-0_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-38629-0_16","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":[{"score":0.41999998688697815,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W6085742","https://openalex.org/W49736614","https://openalex.org/W1542428938","https://openalex.org/W1571087346","https://openalex.org/W1600165106","https://openalex.org/W1998678640","https://openalex.org/W2000163959","https://openalex.org/W2043905543","https://openalex.org/W2044119054","https://openalex.org/W2091224992","https://openalex.org/W2752174437","https://openalex.org/W2944257756"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W2362402143","https://openalex.org/W2766731260","https://openalex.org/W1966089951","https://openalex.org/W2191054341"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}