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