Keyphrases
2-approximation
14%
Approximation Algorithms
73%
Approximation Ratio
18%
Assignment Problem
20%
Bichromatic
18%
Bottleneck Steiner Tree
11%
Chromatic number
17%
Colour Classes
11%
Communication Graph
17%
Complete Graph
11%
Constant-factor Approximation Algorithm
23%
Delaunay Graph
11%
Directional Antenna
18%
Euclidean Distance
15%
Geometric Graph
15%
Geometric Spanners
31%
Graph Problems
12%
Greedy Algorithm
13%
Greedy Spanner
14%
Line Segments
12%
Load Balancing
11%
Localized Routing
18%
Longest Edge
15%
Minimum Cost
16%
Noncrossing Matching
15%
NP-hard
39%
One-point
10%
Optimization Problem
15%
Piercing
20%
Polygon
13%
Polynomial Time
25%
Power Assignment
30%
Power Level
12%
Radio Networks
14%
Range Assignment
11%
Search Problems
10%
Sensor Networks
12%
Shortest Path
15%
Spanners
36%
Spanning Tree
21%
Spanning Tree Problem
11%
Steiner Tree
12%
Strongly Connected
18%
Symmetric Disk Graph
12%
T-spanner
40%
Time Algorithm
24%
Transmitter
10%
Unit Disk
18%
Unit Disk Graph
39%
Wireless Networks
24%
Mathematics
Approximates
16%
Bounded Number
14%
Cardinality
9%
Chromatic Number
13%
Circle
19%
Closest Pair
8%
Collinear Point
9%
Complete Graph
19%
Concludes
7%
Constant Factor
45%
Constant Time
8%
Covering Problem
9%
Cross Section
7%
Data Structure
11%
Dimensional Case
7%
Dimensional Euclidean Space
9%
Directed Path
10%
Distance Function
15%
Edge
100%
Euclidean Distance
37%
Fatness
7%
Greedy Algorithm
10%
Halfplane
7%
Higher Dimensions
9%
Integer
24%
Intersects
11%
Line Segment
21%
Linear Time
16%
Lower and upper bounds
9%
Metric Space
9%
Minimizes
14%
Minimum Spanning Tree
14%
Path Problem
10%
Phylogenetic Diversity
7%
Polygon
24%
Polynomial Time
49%
Positive Integer
9%
Probability Theory
8%
Real Number
12%
Running Time
29%
Set Point
27%
Spanning Tree
21%
Steiner Point
12%
Straight Line
12%
Total Cost
7%
Transmission Range
13%
Tree Problem
24%
Unit Disk
55%
Weight Function
7%
Yao Graph
9%
Computer Science
Approximation (Algorithm)
29%
Approximation Algorithms
76%
Approximation Ratio
12%
Assignment Problem
16%
Cardinality
11%
Chromatic Number
8%
Communication Graph
12%
Communication Network
9%
Constant Factor
20%
Data Structure
10%
Dimensional Case
7%
Directional Antenna
18%
Efficient Algorithm
7%
Euclidean Distance
6%
Fault Tolerant
7%
Gathering Data
5%
Geometric Graph
10%
Graph Coloring
7%
Greedy Algorithm
18%
Intersection Graph
7%
Location Problem
7%
Optimal Algorithm
10%
Optimization Problem
5%
Performance Ratio
7%
Polynomial Time
27%
Preprocessing Time
7%
Quadratic Time
7%
Routing Algorithm
7%
Sensor Networks
16%
Signal Strength
7%
Simple Algorithm
10%
Spanning Tree
7%
steiner tree
7%
Time Approximation Scheme
7%
Transmission Range
10%
Wireless Networks
18%
