{"id":"https://openalex.org/W2141791003","doi":"https://doi.org/10.1007/s00037-005-0200-3","title":"On the complexity of approximating tsp with neighborhoods and related problems","display_name":"On the complexity of approximating tsp with neighborhoods and related problems","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2141791003","doi":"https://doi.org/10.1007/s00037-005-0200-3","mag":"2141791003"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-005-0200-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-005-0200-3","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5007318528","display_name":"Muli Safra","orcid":"https://orcid.org/0000-0002-5022-7727"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shmuel Safra","raw_affiliation_strings":["School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","School of Computer Science, Tel-Aviv University, Israel Tel-Aviv#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Israel Tel-Aviv#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010957839","display_name":"Oded Schwartz","orcid":"https://orcid.org/0000-0003-1309-5566"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oded Schwartz","raw_affiliation_strings":["School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","School of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007318528"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.7043,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.90344643,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"14","issue":"4","first_page":"281","last_page":"307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.8714701533317566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8425054550170898},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.751779317855835},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7398261427879333},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5881648659706116},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5294466018676758},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5053701996803284},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49847984313964844},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.45707613229751587},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4249982535839081},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.419596403837204},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41102683544158936},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40144097805023193},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3963645398616791},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36407116055488586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12528657913208008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11245635151863098}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8714701533317566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8425054550170898},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.751779317855835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7398261427879333},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5881648659706116},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5294466018676758},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5053701996803284},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49847984313964844},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.45707613229751587},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4249982535839081},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.419596403837204},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41102683544158936},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40144097805023193},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3963645398616791},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36407116055488586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12528657913208008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11245635151863098},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"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/s00037-005-0200-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-005-0200-3","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.699999988079071}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1521148214","https://openalex.org/W1524136787","https://openalex.org/W1559701472","https://openalex.org/W1968165428","https://openalex.org/W1986642089","https://openalex.org/W1992490235","https://openalex.org/W1994248285","https://openalex.org/W2003159902","https://openalex.org/W2004012902","https://openalex.org/W2008229997","https://openalex.org/W2008416425","https://openalex.org/W2019242503","https://openalex.org/W2020982884","https://openalex.org/W2035610952","https://openalex.org/W2055569927","https://openalex.org/W2059222268","https://openalex.org/W2059453880","https://openalex.org/W2060380213","https://openalex.org/W2066194644","https://openalex.org/W2076386251","https://openalex.org/W2110367141","https://openalex.org/W2110824994","https://openalex.org/W2123945156","https://openalex.org/W2143996311","https://openalex.org/W2165142526","https://openalex.org/W2166366531","https://openalex.org/W2295961103","https://openalex.org/W3161056635","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2011703460"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}