Keyphrases
Approximation Algorithms
82%
Approximation Ratio
38%
Connection Problem
27%
Node Connectivity
23%
Minimum Cost
22%
K-connected
22%
Undirected Graph
20%
Minimum Power
19%
Improved Approximation
15%
Connectivity Augmentation Problem
15%
Graph Problems
15%
Directed Graph
15%
Edge Set
14%
Survivable Networks
14%
Network Design Problem
12%
2-approximation
11%
Edge-connectivity
10%
Connected Graph
10%
Tree Augmentation
10%
Steiner System
9%
Wireless Networks
9%
Network Problems
9%
K-edge
9%
Edge Cover
9%
K-connected Graph
9%
Degree Constrained
8%
Connected Spanning Subgraph
8%
Disjoint
8%
Connectivity Augmentation
8%
Augmentation Problem
8%
Survivable Network Design Problem
8%
Minimum Size
7%
Connected Subgraphs
7%
2-edge-connected
7%
Steiner Forest
7%
Covering Problem
7%
Polynomial-time Algorithm
7%
NP-hard
6%
Network Design
6%
LP Relaxation
6%
Node Cost
6%
Maximum Cost
6%
Tight
5%
Steiner Point
5%
Graph Connectivity
5%
Dicycle
5%
Minimum number
5%
Edge-disjoint
5%
NP-hard Problem
5%
Integrality Gap
5%
Computer Science
Approximation Algorithms
71%
Approximation Ratio
38%
Subgraphs
32%
Approximation (Algorithm)
31%
Directed Graphs
30%
Connectivity Problem
25%
Network Design Problem
23%
Connected Subgraph
19%
Connectivity Node
17%
Wireless Networks
10%
Network Design
9%
Polynomial Time
5%
steiner tree
5%
Degree Constraint
5%
Mathematics
Edge
100%
Edge-Connectivity
16%
Edge Cover
11%
Integer
11%
Polynomial Time
11%
Connected Graph
10%
Main Result
8%
Tree Problem
7%
Opts _ _ _
5%
Best Approximation
5%
Steiner Point
5%
Approximates
5%
Open Question
5%
Network Connectivity
5%
