Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Min-max partitioning of hypergraphs and symmetric submodular functions
Karthekeyan Chandrasekaran
,
Chandra Chekuri
Industrial and Enterprise Systems Engineering
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Min-max partitioning of hypergraphs and symmetric submodular functions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Min-max
100%
Hypergraph
100%
Symmetric Submodular Functions
100%
Polynomial-time Algorithm
40%
Vertex Set
20%
Maximum Capacity
20%
Oracle Model
20%
Exponential Time Hypothesis
20%
Mathematics
Min-Max
100%
Hypergraphs
100%
Minimizes
40%
Polynomial Time
40%
Polynomial
20%
Approximates
20%
Main Result
20%
Exponential Time
20%