Towards Tight Approximation Bounds for Graph Diameter and Eccentricities.
Arturs BackursLiam RodittyGilad SegalVirginia Vassilevska WilliamsNicole WeinPublished in: CoRR (2018)
Keyphrases
- lower bound
- upper bound
- error bounds
- worst case
- constant factor
- min sum
- generalization error bounds
- approximation methods
- error tolerance
- approximation algorithms
- graph theory
- upper and lower bounds
- average degree
- directed graph
- branch and bound
- graph structure
- closed form
- graph theoretic
- lower and upper bounds
- randomized algorithm
- random walk
- structured data
- graph representation
- greedy algorithm
- graph model
- neural network
- weighted graph
- stage stochastic programs
- approximation guarantees
- directed acyclic graph
- markovian decision
- average case
- graph databases
- np complete
- np hard
- search algorithm