Toward Tight Approximation Bounds for Graph Diameter and Eccentricities.
Arturs BackursLiam RodittyGilad SegalVirginia Vassilevska WilliamsNicole WeinPublished in: SIAM J. Comput. (2021)
Keyphrases
- lower bound
- upper bound
- worst case
- constant factor
- error bounds
- error tolerance
- graph theory
- approximation methods
- stage stochastic programs
- lower and upper bounds
- average degree
- graph representation
- randomized algorithm
- generalization error bounds
- graph model
- min sum
- graph structure
- directed acyclic graph
- approximation algorithms
- graph matching
- undirected graph
- graph theoretic
- branch and bound
- graph construction
- connected components
- random walk
- markovian decision
- rate distortion theory
- clustering algorithm
- graph based algorithm
- approximation error
- upper and lower bounds
- spanning tree
- directed graph
- shortest path
- objective function