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