Skip to main navigation
Skip to search
Skip to main content
Sort by
Keyphrases
Approximation Algorithms
52%
Undirected Graph
35%
Directed Graph
27%
All-pairs Shortest Paths
27%
All-pairs
22%
Time Algorithm
22%
Number of Edges
20%
Shortest Path
20%
Tight
19%
MaxCut
18%
Edge Weight
18%
Semidefinite Programming
17%
Number of Vertices
17%
Approximation Ratio
13%
Log-log
12%
Priority Queue
12%
Weighted Directed Graph
12%
Undirected Weighted Graph
12%
Improved Approximation
11%
Unweighted
11%
Boolean Functions
11%
Polynomial Time
9%
Mean-payoff Games
9%
EREW PRAM
9%
NP-hard
9%
3-SAT
9%
Query Response Time
8%
Simple Cycle
8%
Randomized Algorithms
8%
2-SAT
8%
Distance Queries
7%
MaxSAT
7%
NAE-SAT
7%
Union-find Data Structure
7%
Weighted Graph
7%
Caching
7%
Reachability Algorithm
7%
Dynamic Reachability
7%
Spanning Forest
7%
Read-once Formulas
7%
Total Weight
7%
Private Randomness
7%
Electric Car
7%
Optimal Strategy
7%
Linear Programming
6%
Algorithm Use
6%
Update Time
6%
Constant Time
6%
Monotone
6%
PRAM Algorithms
6%
Mathematics
Edge
100%
Worst Case
41%
Data Structure
31%
Polynomial Time
28%
Running Time
25%
Open Problem
23%
Integer
23%
Approximates
22%
Path Problem
17%
Rounding
17%
Boolean Function
16%
Upper Bound
16%
weighted graph
16%
Matrix (Mathematics)
15%
Probability
13%
Matrix Multiplication
13%
Weighted Undirected Graph
12%
Median
11%
Total Number
9%
Optimal Strategy
9%
Constant Time
9%
Polynomial
9%
Approximability
9%
Simplex Algorithm
9%
Flat Surface
9%
Markov Decision Process
9%
Rounding Procedure
8%
Linear Program
8%
Stochastic Game
7%
Adjacency
7%
Best Approximation
7%
EREW PRAM
7%
Symmetric Boolean Function
7%
Energetics
7%
Maximum Degree
6%
Matching Problem
5%
Constant Factor
5%
Communication Protocol
5%
Weight Function
5%
Cycle Length
5%
Fast Algorithm
5%
Computer Science
Directed Graphs
69%
Data Structure
42%
Approximation Algorithms
31%
Polynomial Time
17%
Proof
13%
Pair Shortest Path
11%
Semidefinite Programming
11%
Shortest Path Problem
11%
Approximation (Algorithm)
9%
Boolean Function
9%
Markov Decision Process
8%
Pair Shortest Path Problem
8%
Optimal Strategy
7%
Communication Complexity
7%
Probability
7%
Delete Operation
6%
weighted graph
6%
Transitive Closure
5%
Constraint Satisfaction Problems
5%
Efficient Algorithm
5%
Fast Algorithm
5%
Spanning Tree
5%
Shortest Path Algorithm
5%
