Approximation Algorithms for Finding Maximum Induced Expanders.
Shayan Oveis GharanAlireza RezaeiPublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- set cover
- network design problem
- minimum cost
- exact algorithms
- approximation ratio
- constant factor
- approximation schemes
- np hardness
- randomized algorithms
- disjoint paths
- primal dual
- open shop
- integrality gap
- computational complexity