Mathematics
Approximation Algorithms
30%
Hardness of Approximation
24%
Graph in graph theory
20%
Binary Search Tree
18%
Hardness
18%
Bicliques
17%
Approximation
16%
Rectangle
16%
Maximum Independent Set
16%
Steiner Tree
15%
Graph Products
14%
Approximability
14%
Pricing
14%
Subgraph
13%
Vertex of a graph
12%
Exponential time
12%
Shortest path
12%
Costs
11%
Planar graph
10%
Clique
9%
Triangle
9%
Induced Matching
9%
Connectivity
9%
Metric Embeddings
8%
Bounded Treewidth
8%
Integrality
8%
Path
8%
Inapproximability
8%
Graph Powers
8%
Independent Set
8%
Heuristics
7%
Minimum Cut
7%
Distributed Algorithms
7%
Lower bound
7%
Cactus
7%
Edge-connectivity
7%
Fixed-parameter Algorithms
7%
Number system
7%
Partition
7%
Subset
6%
Customers
6%
Profit
6%
Edge Coloring
6%
Metric
6%
Linear-time Algorithm
5%
Dominating Set
5%
Poset
5%
Resources
5%
Vertical
5%
Engineering & Materials Science
Approximation algorithms
100%
Hardness
45%
Coloring
26%
Costs
26%
NP-hard
24%
Polynomials
24%
Computer science
13%
Relaxation
12%
Fires
9%
Computational geometry
8%
Data structures
7%
Graph theory
7%
Color
6%
Set theory
5%
Parallel algorithms
5%
Profitability
5%
