Conditionally optimal approximation algorithms for the girth of a directed graph.
Mina DalirrooyfardVirginia Vassilevska WilliamsPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- directed graph
- disjoint paths
- worst case
- undirected graph
- minimum cost
- constant factor
- np hard
- special case
- random walk
- vertex cover
- approximation schemes
- approximation ratio
- maximum flow
- optimal solution
- approximation guarantees
- primal dual
- constant factor approximation
- set cover
- np hardness
- graph structure
- dynamic programming
- upper bound
- randomized algorithms
- winner determination
- combinatorial auctions
- directed acyclic graph
- sensor networks
- graph properties
- linear programming