Keyphrases
Hypergraph
90%
K-cut
63%
Polynomial Time
41%
Hyperedge
37%
Cutting Problem
36%
Min-max
33%
Approximation Factor
28%
Multiway Cut
27%
Cut Set
27%
Polynomial-time Algorithm
25%
Terminal Node
25%
Undirected Graph
25%
Tight
24%
Deterministic Algorithm
24%
Unique Games Conjecture
24%
Ramanujan
24%
Integrality Gap
23%
MaxCut
23%
Directed Graph
23%
K-partition
23%
2-approximation
23%
Directed Acyclic Graph
21%
Maximum Binary Tree
20%
Symmetric Submodular Functions
20%
Stabilizer
20%
Unstable Graph
20%
Edge Weight
18%
Min-cut
18%
Minimum Cut
17%
P-norm
17%
Partition Problem
17%
Query Complexity
14%
Monotone
14%
Smoothed Complexity
13%
Max-cut Problem
13%
Spectral Aspect
13%
Approximate Minima
13%
Multi-criteria
13%
Basis Graph
13%
Odd multiway Cut
13%
Size Constrained
13%
Local Lemma
13%
Parameter Approximation
13%
Invertible
13%
Local Testing
13%
Group-based
13%
Fixed Terminal
13%
Fixed Parameter
13%
Stable Graph
13%
Perfect Matching
13%
Mathematics
Hypergraphs
100%
Polynomial Time
72%
Edge
57%
Polynomial
45%
Minimizes
44%
Lattices
34%
Probability Theory
30%
Min-Max
29%
Approximates
29%
Partitioning Problem
27%
Minimum Cutting
24%
Matrix (Mathematics)
23%
Binary Tree
20%
Stabilizer
20%
Graph Partition
20%
Integer
20%
Upper Bound
18%
Min-Cut
17%
Eigenvalue
16%
Planar Graph
13%
Convex Programming
13%
Small Set
13%
Orthogonality
13%
Max-Cut
13%
Tree Problem
13%
Symmetric Matrix
13%
Linear Program
13%
Adjacency Matrix
11%
Positive Integer
11%
Complete Graph
11%
Expander
11%
Open Problem
10%
Cardinality
10%
Regular Base
9%
Connected Graph
9%
Cyclic Group
9%
Exponential Time
9%
Main Result
8%
Polytope
8%
Subsequence
8%
Connected Component
7%
Query Complexity
7%
Open Question
7%
Orthogonal Basis
7%
Residuals
6%
Plane Method
6%
Search Algorithm
6%
Isoperimetric Inequality
6%
Perfect Matchings
6%
Lower and upper bounds
6%
Computer Science
Directed Graphs
67%
Approximation (Algorithm)
62%
Polynomial Time
42%
approximation factor
37%
Efficient Algorithm
26%
Hyperedges
23%
Optimum Solution
22%
Negative Edge Weight
22%
Binary Tree
20%
Directed Acyclic Graph
20%
Technical Challenge
15%
Graph Partition
15%
Subgraphs
15%
Approximation Algorithms
14%
approximation scheme
13%
Testing Membership
13%
min-sum algorithm
13%
Polynomial Complexity
13%
Satisfying Assignment
13%
Planar Graph
13%
Knapsack
13%
Network Design Problem
13%
Integer Programming
10%
Randomized Algorithm
10%
Linear Program
10%
weighted graph
8%
Polynomial Time Algorithm
7%
Connected Component
7%
Orthogonal Basis
6%
Anonymous Credential
6%
Multicriteria
6%
Multiobjective
6%
Polynomial Algorithm
6%
Decision Problem
6%
Multiplicative Weight
6%
Locality Sensitive Hashing
6%
digraph
6%
Representation of Polynomial
6%
Differential Privacy
6%
Dimensional Simplex
6%
Programming Error
6%
Posterior Probability
6%
Hamming Weight
6%
Convex Combination
6%
Database Record
6%
Linear Programming
6%
Linear Optimization
6%
Degree Polynomial
6%
Error Detection
6%
Proof Technique
6%