Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems.
Mina DalirrooyfardVirginia Vassilevska WilliamsNikhil VyasNicole WeinPublished in: ICALP (2019)
Keyphrases
- approximation algorithms
- related problems
- worst case
- undirected graph
- np hard
- constant factor
- disjoint paths
- minimum cost
- special case
- lower bound
- upper bound
- facility location problem
- broadly applicable
- graph structure
- open shop
- network design problem
- primal dual
- vertex cover
- set cover
- approximation ratio
- connected components
- approximation schemes
- spanning tree
- structured data
- randomized algorithms
- precedence constraints
- np hardness
- graph model
- directed acyclic graph
- weighted graph
- random walk
- error bounds
- computational complexity
- search algorithm
- metric space
- directed graph