{"id":"https://openalex.org/W4399522325","doi":"https://doi.org/10.1145/3618260.3649753","title":"Hypergraph Unreliability in Quasi-Polynomial Time","display_name":"Hypergraph Unreliability in Quasi-Polynomial Time","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399522325","doi":"https://doi.org/10.1145/3618260.3649753"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649753","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649753","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649753","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649753","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055374197","display_name":"Ruoxu Cen","orcid":"https://orcid.org/0009-0007-3900-2344"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ruoxu Cen","raw_affiliation_strings":["Duke University, Durham, USA"],"raw_orcid":"https://orcid.org/0009-0007-3900-2344","affiliations":[{"raw_affiliation_string":"Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026118558","display_name":"Jason Li","orcid":"https://orcid.org/0000-0003-3644-0879"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0003-3644-0879","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, Durham, USA"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055374197"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":0.3457,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59561908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1700","last_page":"1711"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.9840124845504761},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6717603802680969},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.628877580165863},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5514095425605774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5089757442474365},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5000298023223877},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4815947711467743},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44297391176223755},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43792492151260376},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41589587926864624},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24106711149215698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1929175853729248}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9840124845504761},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6717603802680969},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.628877580165863},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5514095425605774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5089757442474365},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5000298023223877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4815947711467743},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44297391176223755},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43792492151260376},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41589587926864624},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24106711149215698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1929175853729248},{"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.1145/3618260.3649753","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649753","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649753","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649753","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649753","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649753","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399522325.pdf"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1971680255","https://openalex.org/W2019334471","https://openalex.org/W2094500233","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2118220538","https://openalex.org/W2531366450","https://openalex.org/W2747217709","https://openalex.org/W2770673807","https://openalex.org/W2903204436","https://openalex.org/W2922372630","https://openalex.org/W3037073585","https://openalex.org/W3158396846","https://openalex.org/W4210631930","https://openalex.org/W4313203312"],"related_works":["https://openalex.org/W2100782222","https://openalex.org/W2115404728","https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W3102280101","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0],"hypergraph":[1,10,76],"unreliability":[2,25,77],"problem":[3,26],"asks":[4],"for":[5,60,74],"the":[6,24,43,75,105,120],"probability":[7],"that":[8,92],"a":[9,19,89],"gets":[11],"disconnected":[12],"when":[13],"every":[14],"hyperedge":[15],"fails":[16],"independently":[17],"with":[18,42,112],"given":[20],"probability.":[21],"For":[22,79],"graphs,":[23],"has":[27],"been":[28],"studied":[29],"over":[30],"many":[31],"decades,":[32],"and":[33],"multiple":[34],"fully":[35],"polynomial-time":[36],"approximation":[37,72],"schemes":[38,73],"are":[39],"known":[40,59],"starting":[41],"work":[44],"of":[45],"Karger":[46],"(STOC":[47],"1995).":[48],"In":[49,65],"contrast,":[50],"prior":[51],"to":[52,108],"this":[53,66],"work,":[54],"no":[55],"non-trivial":[56],"result":[57],"was":[58],"hypergraphs":[61],"(of":[62],"arbitrary":[63],"rank).":[64],"paper,":[67],"we":[68,86,103],"give":[69,88],"quasi-polynomial":[70],"time":[71,96,107],"problem.":[78],"any":[80],"fixed":[81],"\u03b5":[82],"\u2208":[83],"(0,":[84],"1),":[85],"first":[87],"(1+\u03b5)-approximation":[90],"algorithm":[91],"runs":[93],"in":[94,119],"mO(logn)":[95],"on":[97],"an":[98,113],"m-hyperedge,":[99],"n-vertex":[100],"hypergraph.":[101],"Then,":[102],"improve":[104],"running":[106],"m\u00b7":[109],"nO(log2":[110],"n)":[111],"additional":[114],"exponentially":[115],"small":[116],"additive":[117],"term":[118],"approximation.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}