Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms.
Keerti ChoudharyOmer GoldPublished in: SODA (2020)
Keyphrases
- approximation algorithms
- directed graph
- worst case
- undirected graph
- disjoint paths
- np hard
- lower bound
- upper bound
- vertex cover
- minimum cost
- special case
- random walk
- approximation ratio
- distance measure
- open shop
- distance function
- facility location problem
- set cover
- graph structure
- primal dual
- network design problem
- np hardness
- strongly connected
- constant factor
- error bounds
- directed acyclic graph
- greedy algorithm
- binary images
- strongly np hard
- approximation schemes
- combinatorial auctions
- integrality gap