{"id":"https://openalex.org/W1551930937","doi":"https://doi.org/10.4086/toc.2014.v010a009","title":"","display_name":"","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1551930937","doi":"https://doi.org/10.4086/toc.2014.v010a009","mag":"1551930937"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2014.v010a009","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2014.v010a009","pdf_url":"https://theoryofcomputing.org/articles/v010a009/v010a009.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v010a009/v010a009.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["KTH Royal Institue of Technology"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institue of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059698872"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":2.4926,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.88416174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"1","first_page":"217","last_page":"236"},"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.9994999766349792,"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.9987000226974487,"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/combinatorics","display_name":"Combinatorics","score":0.5917826890945435},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5522923469543457},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5304201245307922},{"id":"https://openalex.org/keywords/approx","display_name":"Approx","score":0.5116803646087646},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.497510701417923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4923502206802368},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45866385102272034},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42780542373657227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3972390294075012},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25345855951309204}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5917826890945435},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5522923469543457},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5304201245307922},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.5116803646087646},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.497510701417923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4923502206802368},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45866385102272034},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42780542373657227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3972390294075012},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25345855951309204},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2014.v010a009","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2014.v010a009","pdf_url":"https://theoryofcomputing.org/articles/v010a009/v010a009.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2014.v010a009","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2014.v010a009","pdf_url":"https://theoryofcomputing.org/articles/v010a009/v010a009.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1551930937.pdf","grobid_xml":"https://content.openalex.org/works/W1551930937.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W162897487","https://openalex.org/W1481223916","https://openalex.org/W1506609434","https://openalex.org/W1527607312","https://openalex.org/W1547496874","https://openalex.org/W1772550183","https://openalex.org/W1983002996","https://openalex.org/W1999032440","https://openalex.org/W2038652993","https://openalex.org/W2048104107","https://openalex.org/W2059222268","https://openalex.org/W2076386251","https://openalex.org/W2117226423","https://openalex.org/W2136400551","https://openalex.org/W2141355868","https://openalex.org/W2397264686","https://openalex.org/W2497909753","https://openalex.org/W2569455461","https://openalex.org/W2914372558","https://openalex.org/W2949399323","https://openalex.org/W2963407566","https://openalex.org/W3217021010","https://openalex.org/W4205962651"],"related_works":["https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598","https://openalex.org/W2341709160","https://openalex.org/W2758988501","https://openalex.org/W1596059437","https://openalex.org/W3013791021","https://openalex.org/W2946024655"],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Salesman":[2],"Problem":[3],"is":[4,19],"one":[5],"of":[6,14,53],"the":[7,12,26,29,51,70],"most":[8],"studied":[9],"problems":[10],"in":[11],"theory":[13],"algorithms":[15],"and":[16,39,47,55,64],"its":[17],"approximability":[18],"a":[20],"long-standing":[21],"open":[22],"question.":[23],"Prior":[24],"to":[25,37,72],"present":[27],"work,":[28],"best":[30],"known":[31],"inapproximability":[32,66],"threshold":[33],"was":[34],"220/219,":[35],"due":[36],"Papadimitriou":[38],"Vempala.":[40],"Here,":[41],"using":[42],"an":[43,62],"essentially":[44],"different":[45],"construction":[46],"also":[48],"relying":[49],"on":[50,57],"work":[52],"Berman":[54],"Karpinski":[56],"bounded-occurrence":[58],"CSPs,":[59],"we":[60],"give":[61],"alternative":[63],"simpler":[65],"proof":[67],"which":[68],"improves":[69],"bound":[71],"185/184.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2016-06-24T00:00:00"}