Towards tight approximation bounds for graph diameter and eccentricities.
Arturs BackursLiam RodittyGilad SegalVirginia Vassilevska WilliamsNicole WeinPublished in: STOC (2018)
Keyphrases
- lower bound
- upper bound
- worst case
- error bounds
- constant factor
- generalization error bounds
- graph model
- approximation methods
- min sum
- approximation algorithms
- graph representation
- stage stochastic programs
- error tolerance
- randomized algorithm
- average degree
- random walk
- lower and upper bounds
- markovian decision
- graph theoretic
- directed acyclic graph
- graph matching
- directed graph
- closed form
- spanning tree
- graph clustering
- approximation error
- weighted graph
- graph structure
- approximation guarantees
- graph theory
- bipartite graph
- neural network