Keyphrases
Approximation Algorithms
52%
Directed Graph
39%
Undirected Graph
38%
All-pairs Shortest Paths
31%
Shortest Path
26%
Time Algorithm
24%
Tight
23%
Number of Edges
23%
All-pairs
21%
Number of Vertices
20%
Edge Weight
18%
Semidefinite Programming
18%
MaxCut
16%
Log-log
14%
Priority Queue
14%
Undirected Weighted Graph
13%
Boolean Functions
13%
Unweighting
12%
Query Response Time
12%
Polynomial Time
11%
Weighted Directed Graph
11%
Distance Query
11%
3-SAT
11%
Randomized Algorithms
10%
2-SAT
10%
Weighted Graph
10%
Improved Approximation
10%
Mean-payoff Games
10%
Caching
9%
Spanners
9%
EREW PRAM
9%
Reachability Algorithm
9%
Dynamic Reachability
9%
Carry Select Adder
9%
Approximation Ratio
9%
Update Time
9%
Monotone
9%
NP-hard
9%
Constant Time
9%
Simple Cycle
9%
Random Restrictions
9%
Pivot Rule
8%
Single-source Shortest Paths
8%
Simplex Algorithm
8%
Shortest Path Algorithm
8%
Matrix multiplication Algorithm
8%
Shortest Path Problem
8%
Optimal Strategy
8%
Unweighted Graph
7%
Rectangular Matrix multiplication
7%
Mathematics
Edge
100%
Worst Case
35%
Polynomial Time
28%
Data Structure
27%
Running Time
25%
Integer
23%
Approximates
22%
Path Problem
22%
Open Problem
19%
Upper Bound
18%
Boolean Function
17%
weighted graph
16%
Matrix (Mathematics)
16%
Matrix Multiplication
16%
Probability Theory
12%
Median
12%
Weighted Undirected Graph
12%
Rounding
10%
EREW PRAM
9%
Simplex Algorithm
9%
Optimal Strategy
9%
Rounding Procedure
8%
Approximability
8%
Linear Program
8%
Adjacency
7%
Symmetric Boolean Function
7%
Total Weight
7%
Polynomial
7%
Maximum Degree
6%
Main Result
6%
Matching Problem
6%
Constant Factor
6%
Stochastic Game
5%
Fixed Number
5%
Markov Decision Process
5%
Cycle Length
5%
Computer Science
Directed Graphs
82%
Data Structure
45%
Approximation Algorithms
23%
Pair Shortest Path Problem
17%
Polynomial Time
17%
Pair Shortest Path
17%
Shortest Path Problem
14%
Approximation (Algorithm)
12%
weighted graph
12%
Matrix Multiplication
12%
Optimal Strategy
9%
Simplex Algorithm
7%
Markov Decision Process
7%
Communication Complexity
7%
Delete Operation
7%
Efficient Algorithm
6%
Transitive Closure
6%
Connected Component
6%
Boolean Function
6%
Constraint Satisfaction Problems
6%
All-Pairs-Shortest-Paths Algorithm
6%
polynomial-time algorithm
6%
Semidefinite Programming
5%
Linear Program
5%
Spanning Tree
5%
Shortest Path Algorithm
5%
Subgraphs
5%
Fast Algorithm
5%
