{"id":"https://openalex.org/W3112296152","doi":"https://doi.org/10.4086/toc.2020.v016a014","title":"","display_name":"","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3112296152","doi":"https://doi.org/10.4086/toc.2020.v016a014","mag":"3112296152"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2020.v016a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2020.v016a014","pdf_url":"http://www.theoryofcomputing.org/articles/v016a014/v016a014.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":"http://www.theoryofcomputing.org/articles/v016a014/v016a014.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100430766","display_name":"Shi Li","orcid":"https://orcid.org/0000-0001-9140-9415"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shi Li","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0115,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82416888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"8"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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.9510999917984009,"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/hypergraph","display_name":"Hypergraph","score":0.8766525983810425},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.762209415435791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7519605159759521},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.7172869443893433},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5937144160270691},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5582060813903809},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5029961466789246},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4637928605079651},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4304197132587433},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.426937460899353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36426591873168945}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8766525983810425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.762209415435791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7519605159759521},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.7172869443893433},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5937144160270691},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5582060813903809},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5029961466789246},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4637928605079651},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4304197132587433},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.426937460899353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36426591873168945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2020.v016a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2020.v016a014","pdf_url":"http://www.theoryofcomputing.org/articles/v016a014/v016a014.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.2020.v016a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2020.v016a014","pdf_url":"http://www.theoryofcomputing.org/articles/v016a014/v016a014.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":[],"awards":[{"id":"https://openalex.org/G3981631003","display_name":"CAREER: Approximate Scheduling Algorithms via Mathematical Relaxations","funder_award_id":"1844890","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G401424543","display_name":null,"funder_award_id":"CCF-1526799","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5149950309","display_name":null,"funder_award_id":"CCF-1566356","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5206232573","display_name":null,"funder_award_id":"CCF-1844890","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5234195991","display_name":"AF: Small: Cuts, Connectivity and Partitioning in Graphs, Hypergraphs and Beyond","funder_award_id":"1907937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5259214660","display_name":null,"funder_award_id":"1717134","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G847537906","display_name":null,"funder_award_id":"CCF-1907937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3112296152.pdf","grobid_xml":"https://content.openalex.org/works/W3112296152.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1981202693","https://openalex.org/W2026838540","https://openalex.org/W2030365814","https://openalex.org/W2063597011","https://openalex.org/W2091602684","https://openalex.org/W2119003693","https://openalex.org/W2122466336","https://openalex.org/W2167637346","https://openalex.org/W2552383377","https://openalex.org/W2613308084","https://openalex.org/W2950135040","https://openalex.org/W2951914620","https://openalex.org/W2984493948","https://openalex.org/W3024975976","https://openalex.org/W3036281379","https://openalex.org/W3128792128","https://openalex.org/W3191678348","https://openalex.org/W4226347946"],"related_works":["https://openalex.org/W1608444752","https://openalex.org/W2950365512","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4299354108","https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W3172736027","https://openalex.org/W1561811279"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,5,10,25,34,38,98,106,115,144],"approximability":[3],"of":[4,33,109,146],"k-WAY":[6,90,130],"HYPERGRAPH":[7,91,131],"CUT":[8,92,132],"problem:":[9],"input":[11],"is":[12,27,49,121,137,143],"an":[13,21,87,94],"edge-weighted":[14],"hypergraph":[15,40],"G":[16,48],"=":[17],"(V,":[18],"E)":[19],"and":[20,24,59,141],"integer":[22],"k":[23,44],"goal":[26],"to":[28],"remove":[29],"a":[30,50,55,82,138],"min-weight":[31],"subset":[32],"edges":[35],"such":[36],"that":[37,86,113],"residual":[39],"has":[41,67],"at":[42],"least":[43],"connected":[45],"components.":[46],"When":[47],"graph":[51],"this":[52,77],"problem":[53],"admits":[54],"2(1":[56],"-1/k)-approximation":[57],"(Saran":[58],"Vazirani,":[60],"SIAM":[61],"J.":[62],"Comput.":[63],"1995).":[64],"However,":[65],"there":[66,120],"been":[68],"no":[69,122],"non-trivial":[70],"approximation":[71],"ratio":[72],"for":[73,89,97,129],"general":[74],"hypergraphs.":[75],"In":[76],"note":[78],"we":[79],"show,":[80],"via":[81],"very":[83],"simple":[84],"reduction,":[85],"-approximation":[88,96,128],"implies":[93,112],"2":[95],"DENSEST":[99],"-SUBGRAPH":[100],"problem.":[101],"Our":[102],"reduction":[103],"combined":[104],"with":[105],"hardness":[107],"result":[108],"(Manurangsi,":[110],"STOC'17)":[111],"under":[114],"Exponential":[116],"Time":[117],"Hypothesis":[118],"(ETH),":[119],"n":[123,142],"1/(log":[124],"log":[125],"n)":[126],"c":[127,134],"where":[133],">":[135],"0":[136],"universal":[139],"constant":[140],"number":[145],"nodes.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2020-12-21T00:00:00"}