Tight conditional lower bounds for approximating diameter in directed graphs.
Mina DalirrooyfardNicole WeinPublished in: STOC (2021)
Keyphrases
- directed graph
- lower bound
- upper bound
- random walk
- branch and bound algorithm
- branch and bound
- np hard
- lower and upper bounds
- random field model
- maximum flow
- graph structure
- sample complexity
- worst case
- quadratic assignment problem
- linear programming relaxation
- upper and lower bounds
- maximum distance
- graph structures
- directed acyclic graph
- optimal solution
- objective function
- vc dimension
- web graph
- minimum cost
- machine learning
- shortest path