{"id":"https://openalex.org/W2021244889","doi":"https://doi.org/10.1145/2596583.2596599","title":"Guest column","display_name":"Guest column","publication_year":2014,"publication_date":"2014-03-17","ids":{"openalex":"https://openalex.org/W2021244889","doi":"https://doi.org/10.1145/2596583.2596599","mag":"2021244889"},"language":"en","primary_location":{"id":"doi:10.1145/2596583.2596599","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2596583.2596599","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["Kyoto University, Japan"],"affiliations":[{"raw_affiliation_string":"Kyoto University, Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059698872"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61516378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"45","issue":"1","first_page":"48","last_page":"65"},"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.9994000196456909,"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.9977999925613403,"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/bounded-function","display_name":"Bounded function","score":0.6284719705581665},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5408502221107483},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.49339762330055237},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49213117361068726},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48927947878837585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4862895905971527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4724871516227722},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4550548195838928},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.41946911811828613},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.4149361252784729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38115614652633667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2828971743583679},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16897594928741455}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6284719705581665},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5408502221107483},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.49339762330055237},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49213117361068726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48927947878837585},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4862895905971527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4724871516227722},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4550548195838928},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.41946911811828613},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4149361252784729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38115614652633667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2828971743583679},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16897594928741455},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2596583.2596599","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2596583.2596599","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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":50,"referenced_works":["https://openalex.org/W56066823","https://openalex.org/W82648965","https://openalex.org/W162897487","https://openalex.org/W268194639","https://openalex.org/W272982077","https://openalex.org/W1481223916","https://openalex.org/W1501644705","https://openalex.org/W1506609434","https://openalex.org/W1518985150","https://openalex.org/W1527607312","https://openalex.org/W1547496874","https://openalex.org/W1551930937","https://openalex.org/W1772550183","https://openalex.org/W1913226373","https://openalex.org/W1965255372","https://openalex.org/W1966923282","https://openalex.org/W1976584101","https://openalex.org/W1993216347","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2011039300","https://openalex.org/W2015698277","https://openalex.org/W2024298276","https://openalex.org/W2027515293","https://openalex.org/W2030562672","https://openalex.org/W2038225707","https://openalex.org/W2038652993","https://openalex.org/W2048104107","https://openalex.org/W2056590617","https://openalex.org/W2059222268","https://openalex.org/W2081254453","https://openalex.org/W2081444009","https://openalex.org/W2087038607","https://openalex.org/W2091260378","https://openalex.org/W2094067618","https://openalex.org/W2110158710","https://openalex.org/W2113004376","https://openalex.org/W2117226423","https://openalex.org/W2137118456","https://openalex.org/W2141355868","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2160111458","https://openalex.org/W2497909753","https://openalex.org/W2569455461","https://openalex.org/W2914372558","https://openalex.org/W2949399323","https://openalex.org/W2951429494","https://openalex.org/W3143204987","https://openalex.org/W3217021010"],"related_works":["https://openalex.org/W1799661101","https://openalex.org/W2180856585","https://openalex.org/W1593899949","https://openalex.org/W2123500285","https://openalex.org/W4299303486","https://openalex.org/W2396936874","https://openalex.org/W2962875727","https://openalex.org/W1547496874","https://openalex.org/W4299959176","https://openalex.org/W2021244889"],"abstract_inverted_index":{"After":[0],"two":[1],"decades":[2],"of":[3,7,56,102],"progress":[4],"in":[5,23,80,124],"hardness":[6,55],"approximation":[8,57,85],"we":[9,72],"finally":[10],"completely":[11],"understand":[12],"the":[13,44,51,67,74,81,127],"extent":[14],"to":[15,36,62],"which":[16,50],"many":[17,32],"optimization":[18],"problems":[19,34],"can":[20],"be":[21,63,114],"approximated":[22],"polynomial":[24],"time.":[25],"Unfortunately,":[26],"however,":[27],"and":[28,77,99,129],"despite":[29],"significant":[30],"efforts,":[31],"important":[33],"continue":[35],"resist":[37],"such":[38],"an":[39],"understanding.":[40],"One":[41],"example":[42],"is":[43],"famous":[45],"Traveling":[46],"Salesman":[47],"Problem,":[48],"for":[49,88],"best":[52,83],"currently":[53,82],"known":[54,84],"bounds":[58,87],"are":[59,93,132],"strongly":[60],"believed":[61],"quite":[64],"far":[65],"from":[66],"truth.":[68],"In":[69],"this":[70,89],"article,":[71],"describe":[73],"main":[75],"tools":[76],"techniques":[78],"used":[79],"lower":[86],"problem.":[90],"Among":[91],"them":[92],"expander-like":[94],"graph":[95],"constructions":[96],"called":[97],"amplifiers":[98],"bounded-occurrence":[100],"instances":[101],"standard":[103],"constraint":[104],"satisfaction":[105],"problems.":[106],"We":[107],"also":[108],"discuss":[109],"how":[110,117],"these":[111],"ideas":[112],"could":[113],"(modestly)":[115],"improved,":[116],"(and":[118],"whether)":[119],"they":[120],"may":[121],"prove":[122],"useful":[123],"eventually":[125],"resolving":[126],"problem":[128],"what":[130],"ingredients":[131],"still":[133],"missing.":[134]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}