Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
On the hardness of approximating the k-way hypergraph cut problem
Chandra Chekuri
, Shi Li
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Comment/debate
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the hardness of approximating the k-way hypergraph cut problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Hardness Results
100%
Cutting Problem
100%
2-approximation
100%
Hypergraph Cut
100%
Universal Constants
50%
Edge Weight
50%
Node number
50%
Saran
50%
Approximation Ratio
50%
Hypergraph
50%
K-connected
50%
Connected Component
50%
Exponential Time Hypothesis
50%
Weighted Hypergraph
50%
General Hypergraph
50%
Mathematics
Hypergraphs
100%
Edge
50%
Residuals
25%
Integer
25%
Exponential Time
25%
Approximability
25%
Connected Component
25%
Engineering
Nodes
100%
Connected Component
100%
Computer Science
Approximation (Algorithm)
100%
Approximation Ratio
20%
Connected Component
20%