{"id":"https://openalex.org/W2110906177","doi":"https://doi.org/10.1109/ccc.2003.1214436","title":"A strong inapproximability gap for a generalization of minimum bisection","display_name":"A strong inapproximability gap for a generalization of minimum bisection","publication_year":2004,"publication_date":"2004-01-24","ids":{"openalex":"https://openalex.org/W2110906177","doi":"https://doi.org/10.1109/ccc.2003.1214436","mag":"2110906177"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2003.1214436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5037246013","display_name":"Jonas Holmerin","orcid":null},"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":false,"raw_author_name":"J. Holmerin","raw_affiliation_strings":["Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden","Dept. of Numerical Anal. & Comput. Sci., R Inst. of Technol., Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Dept. of Numerical Anal. & Comput. Sci., R Inst. of Technol., Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Khot","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Department of Computer Science, Princeton University, Princeton , NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton , NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"371","last_page":"378"},"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.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9933000206947327,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.722845196723938},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.7180809378623962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7048012018203735},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.6893151998519897},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6191202998161316},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.588037371635437},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5408869385719299},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48191240429878235},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.42562761902809143},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.387090802192688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17648565769195557},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16187027096748352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12605997920036316},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06745439767837524}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.722845196723938},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.7180809378623962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7048012018203735},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6893151998519897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6191202998161316},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.588037371635437},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5408869385719299},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48191240429878235},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.42562761902809143},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.387090802192688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17648565769195557},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16187027096748352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12605997920036316},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06745439767837524},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccc.2003.1214436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W113175115","https://openalex.org/W1499770711","https://openalex.org/W1970259241","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2072802070","https://openalex.org/W2081254453","https://openalex.org/W2086653003","https://openalex.org/W2111385661","https://openalex.org/W2125278290","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2157948169","https://openalex.org/W2202947145"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W3112697985","https://openalex.org/W41290553","https://openalex.org/W2585516632","https://openalex.org/W1986919722","https://openalex.org/W2093663313","https://openalex.org/W40332083","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W2577097539"],"abstract_inverted_index":{"As":[0],"a":[1,14,31,109,123,163],"problem":[2,87,143,153,170],"with":[3,23],"similar":[4,134],"properties":[5],"to":[6,74,100,146,173],"minimum":[7,60,137],"bisection,":[8],"we":[9,94],"consider":[10,64],"the":[11,36,59,65,77,86,104,114,142,152,156,169],"following:":[12],"given":[13],"homogeneous":[15],"system":[16],"of":[17,38,51,113,127,154,159],"linear":[18],"equations":[19,115,129,160],"over":[20],"Z/sub":[21],"2/,":[22],"exactly":[24],"k":[25],"variables":[26],"in":[27],"each":[28],"equation,":[29],"find":[30],"balanced":[32,42,164],"assignment":[33,43],"that":[34,96,106,120,141,168],"minimizes":[35],"number":[37,50,158],"satisfied":[39,118,161],"equations.":[40],"A":[41,133],"is":[44,58,72,80,88,98,144,171],"one":[45],"which":[46],"contains":[47],"an":[48],"equal":[49],"0s":[52],"and":[53,119],"1s.":[54],"When":[55],"k=2,":[56],"this":[57,69,166],"bisection":[61,138],"problem.":[62],"We":[63],"case":[66],"k=3.":[67],"In":[68],"case,":[70],"it":[71,97],"NP-complete":[73],"determine":[75,101],"whether":[76],"object":[78],"function":[79],"zero":[81],"[U.":[82],"Feige,":[83],"(2003)],":[84],"so":[85],"not":[89],"approximable":[90],"at":[91,121],"all.":[92],"However,":[93],"prove":[95],"NP-hard":[99,172],"distinguish":[102],"between":[103],"cases":[105],"all":[107,128],"but":[108],"fraction":[110,124],"/spl":[111,180],"epsi/":[112,126],"can":[116],"be":[117,131],"least":[122],"1/4-/spl":[125],"cannot":[130],"satisfied.":[132],"result":[135],"for":[136,178],"would":[139],"imply":[140],"hard":[145],"approximate":[147,174],"within":[148,175],"any":[149,179],"constant.":[150],"For":[151],"approximating":[155],"maximum":[157],"by":[162],"assignment,":[165],"implies":[167],"4/3-/spl":[176],"epsi/,":[177],"epsi/>0.":[181]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}