{"id":"https://openalex.org/W2091602684","doi":"https://doi.org/10.1137/s0097539705447037","title":"Ruling Out PTAS for Graph Min\u2010Bisection, Dense k\u2010Subgraph, and Bipartite Clique","display_name":"Ruling Out PTAS for Graph Min\u2010Bisection, Dense k\u2010Subgraph, and Bipartite Clique","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2091602684","doi":"https://doi.org/10.1137/s0097539705447037","mag":"2091602684"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539705447037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705447037","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Subhash Khot","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5067917669"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9892,"has_fulltext":false,"cited_by_count":245,"citation_normalized_percentile":{"value":0.96731496,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"36","issue":"4","first_page":"1025","last_page":"1071"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9993000030517578,"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/T10237","display_name":"Cryptography and Data Security","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7996305227279663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7429301738739014},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6561807990074158},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5561025142669678},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5326067209243774},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5305690765380859},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5105284452438354},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.479025274515152},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.45145145058631897},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4462222754955292},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.440591961145401},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40749987959861755},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2879999279975891},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18736648559570312},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10948744416236877},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.09427309036254883}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7996305227279663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7429301738739014},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6561807990074158},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5561025142669678},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5326067209243774},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5305690765380859},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5105284452438354},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.479025274515152},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.45145145058631897},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4462222754955292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.440591961145401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40749987959861755},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2879999279975891},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18736648559570312},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10948744416236877},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.09427309036254883}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539705447037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705447037","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.3324","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.3324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-static.cc.gatech.edu/~khot/papers/mdc-bc.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1970259241","https://openalex.org/W1999032440","https://openalex.org/W2018925011","https://openalex.org/W2019578639","https://openalex.org/W2036836182","https://openalex.org/W2053651631","https://openalex.org/W2058422149","https://openalex.org/W2081254453","https://openalex.org/W2086653003","https://openalex.org/W2111385661","https://openalex.org/W2128057004","https://openalex.org/W2129027842","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2169665116","https://openalex.org/W2610313478","https://openalex.org/W3004537778","https://openalex.org/W3144422206","https://openalex.org/W4235946010"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W2794565019","https://openalex.org/W2282273380","https://openalex.org/W4296570398","https://openalex.org/W2264356384","https://openalex.org/W2113826940","https://openalex.org/W1561005397","https://openalex.org/W2952246343","https://openalex.org/W2043005464","https://openalex.org/W2033003769"],"abstract_inverted_index":{"Assuming":[0],"that":[1,10,51,92],"NP":[2],"$\\not\\subseteq$":[3],"$\\cap_{\\epsilon":[4],">":[5],"0}$":[6],"BPTIME($2^{n^\\epsilon}$),":[7],"we":[8,43,81],"show":[9],"graph":[11],"min\u2010bisection,":[12],"dense":[13],"k\u2010subgraph,":[14],"and":[15,118],"bipartite":[16],"clique":[17],"have":[18],"no":[19],"polynomial":[20,95],"time":[21],"approximation":[22],"scheme":[23],"(PTAS).":[24],"We":[25],"give":[26],"a":[27,45,60,72,88,93,98,126],"reduction":[28],"from":[29],"the":[30,55,63,67,77,83,110],"minimum":[31],"distance":[32],"of":[33,41,66,90,102,129],"code":[34],"(MDC)":[35],"problem.":[36],"Starting":[37],"with":[38],"an":[39],"instance":[40],"MDC,":[42],"build":[44],"quasi\u2010random":[46,61],"probabilistically":[47,123],"checkable":[48],"proof":[49],"(PCP)":[50],"suffices":[52],"to":[53,97,114],"prove":[54],"desired":[56],"inapproximability":[57],"results.":[58],"In":[59],"PCP,":[62],"query":[64],"pattern":[65],"verifier":[68],"looks":[69],"random":[70],"in":[71],"certain":[73],"precise":[74],"sense.":[75],"Among":[76],"several":[78],"new":[79],"techniques":[80],"introduce,":[82],"most":[84],"interesting":[85],"one":[86],"gives":[87],"way":[89],"certifying":[91],"given":[94,99],"belongs":[96],"linear":[100],"subspace":[101],"polynomials.":[103],"As":[104],"is":[105],"important":[106],"for":[107],"our":[108],"purpose,":[109],"certificate":[111],"itself":[112],"happens":[113],"be":[115,121],"another":[116],"polynomial,":[117],"it":[119],"can":[120],"checked":[122],"by":[124],"reading":[125],"constant":[127],"number":[128],"its":[130],"values.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":15}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}