Subquadratic time approximation algorithms for the girth.
Liam RodittyVirginia Vassilevska WilliamsPublished in: SODA (2012)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- set cover
- primal dual
- facility location problem
- open shop
- exact algorithms
- approximation schemes
- network design problem
- constant factor
- precedence constraints
- np hardness
- approximation ratio
- learning algorithm
- genetic algorithm
- mathematical model
- upper bound