Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs.
Mina DalirrooyfardNicole WeinPublished in: CoRR (2020)
Keyphrases
- directed graph
- lower bound
- upper bound
- random walk
- branch and bound algorithm
- branch and bound
- np hard
- worst case
- objective function
- random field model
- undirected graph
- lower and upper bounds
- optimal cost
- directed acyclic graph
- upper and lower bounds
- optimal solution
- graph structure
- web graph
- vc dimension
- linear programming relaxation
- quadratic assignment problem
- maximum flow
- disjoint paths
- sample complexity
- graph structures
- image registration