Skip to main navigation
Skip to search
Skip to main content
Sort by
Keyphrases
2-approximation
24%
3-colorable Graphs
15%
3-uniform Hypergraph
15%
Additive Spanners
16%
Additive Stretch
16%
Adjacency
24%
Approximation Algorithms
81%
Approximation Bound
18%
Approximation Guarantee
24%
Approximation Ratio
44%
Chromatic number
12%
Dense Subgraphs
58%
Density Threshold
24%
Directed Steiner Forest
24%
Distance Preservers
16%
Flow-cut Gap
12%
Graph Spanners
27%
Hardness of Approximation
17%
Hardness Results
13%
Hyperedge
24%
Hypergraph
27%
Improved Approximation
45%
Integrality Gap
36%
Knapsack
24%
Label Cover
28%
Length-bounded Cuts
12%
Lift-and-project Methods
24%
Linear Index Coding
24%
Log-density
39%
LP Hierarchies
13%
Maximum Degree
48%
MinRank
24%
New Approximation
18%
NP-hard
18%
Number of Edges
26%
P-norm
21%
Real-time Rendering
16%
Semidefinite Hierarchies
15%
Semidefinite Programming
30%
Semidefinite Relaxation
21%
Set Cover
24%
Sherali-Adams
16%
Small Sets
20%
Spanners
35%
Stretch Factor
12%
Subhypergraph
18%
Tight
21%
Traversal
24%
Unique Games
25%
Vertex Expansion
20%
Mathematics
Approximability
6%
Approximates
56%
Arbitrary Constant
24%
Best Approximation
12%
Bipartite Graph
12%
Cardinality
6%
Chromatic Number
12%
Clustering
12%
Colorable Graph
15%
Combinatorial Algorithm
12%
Combinatorial Optimization
12%
Convex Programming
12%
Cut Node
6%
Decomposition Theorem
12%
Edge
93%
Eigenvalue
6%
Exponential Time
12%
Extremal
7%
Graph Coloring
12%
Greedy Algorithm
15%
Hypergraphs
45%
Independent Set
24%
Linear Programming
12%
Linear Programming Relaxation
6%
Low Degree
33%
Lower and upper bounds
18%
Main Result
15%
Markov Chain
12%
Maximum Degree
48%
Minimization Problem
16%
Minimizes
47%
Multiplicative
27%
Nash Equilibrium
12%
Network Connectivity
7%
Objective Function
27%
Polynomial
12%
Polynomial Time
32%
Random Graphs
15%
Random Walk
8%
Rounding
30%
Small Set
20%
Total Number
12%
Upper Bound
37%
Weight Function
12%
Computer Science
Approximation (Algorithm)
100%
Approximation Algorithms
65%
approximation factor
6%
Approximation Ratio
26%
Arbitrary Constant
10%
Bipartite Graph
12%
Cache Optimization
24%
Constant Factor
12%
Density Threshold
12%
Discrete Optimization
24%
Graph Coloring
24%
Graphic Hardware
24%
Greedy Algorithm
12%
Linear Programming
26%
Minimization Problem
24%
Network Design Problem
8%
Optimization Algorithm
24%
Optimization Problem
24%
Parallelism
24%
Polynomial Time Algorithm
12%
polynomial-time algorithm
15%
Practical Solution
24%
Rendering Algorithm
24%
Satisfying Assignment
24%
Semidefinite Programming
24%
Shannon Capacity
24%
Side Information
24%
SIMD
24%
Sparsity
12%
Subgraphs
32%