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