Keyphrases
2-approximation
19%
3-colorable Graphs
12%
3-uniform Hypergraph
12%
Additive Spanners
12%
Additive Stretch
12%
Adjacency
18%
Approximation Algorithms
63%
Approximation Bound
14%
Approximation Guarantee
18%
Approximation Ratio
35%
Dense Subgraphs
36%
Density Threshold
18%
Directed Steiner Forest
18%
Distance Preservers
12%
Fair Clustering
9%
Flow-cut Gap
9%
Graph Spanners
21%
Hardness of Approximation
13%
Hardness Results
10%
Hyperedge
18%
Hypergraph
21%
Improved Approximation
35%
Integrality Gap
28%
Knapsack
18%
Label Cover
21%
Length-bounded Cuts
9%
Lift-and-project Methods
18%
Linear Index Coding
18%
Log-density
30%
LP Hierarchies
10%
Maximum Degree
37%
MinRank
18%
New Approximation
14%
NP-hard
14%
Number of Edges
20%
P-norm
17%
Real-time Rendering
12%
Semidefinite Programming
23%
Semidefinite Programming Hierarchies
12%
Semidefinite Relaxation
17%
Set Cover
18%
Sherali-Adams
13%
Small Sets
15%
Spanners
27%
Stretch Factor
9%
Subhypergraph
21%
Tight
17%
Traversal
18%
Unique Games
20%
Vertex Expansion
15%
Mathematics
Approximates
41%
Arbitrary Constant
12%
Chromatic Number
9%
Clustering
9%
Colorable Graph
11%
Combinatorial Algorithm
9%
Constant Factor
9%
Convex Programming
9%
Decomposition Theorem
9%
Edge
57%
Exponential Time
9%
Graph Coloring
9%
Greedy Algorithm
12%
Hypergraphs
35%
Independent Set
18%
Linear Programming
9%
Linear Programming Relaxation
14%
Low Degree
25%
Lower and upper bounds
14%
Main Result
11%
Markov Chain
9%
Maximum Degree
37%
Minimization Problem
13%
Minimizes
36%
Multiplicative
12%
Nash Equilibrium
9%
Objective Function
21%
Polynomial
9%
Polynomial Time
25%
Random Graph
12%
Random Walk
6%
Rounding
23%
Small Set
15%
Total Number
9%
Upper Bound
26%
Weight Function
9%
Computer Science
Approximation (Algorithm)
100%
Approximation Algorithms
47%
Approximation Ratio
19%
Arbitrary Constant
8%
Bipartite Graph
9%
Cache Optimization
18%
Constant Factor
9%
Density Threshold
18%
Discrete Optimization
18%
Graphic Hardware
18%
Knapsack
18%
Linear Programming
20%
Nash Equilibrium
9%
Network Design Problem
6%
Objective Function
11%
Optimization Algorithm
18%
Optimization Problem
18%
Parallelism
18%
Practical Solution
18%
Random Graphs
6%
Rendering Algorithm
18%
Satisfying Assignment
18%
SIMD
18%
Subgraphs
43%
