Approximation Algorithms for Finding Maximum Induced Expanders.
Shayan Oveis GharanAlireza RezaeiPublished in: SODA (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- primal dual
- network design problem
- randomized algorithms
- np hardness
- approximation ratio
- set cover
- exact algorithms
- constant factor
- facility location problem
- lower bound
- precedence constraints
- undirected graph
- optimal solution
- open shop
- integrality gap
- finding optimal
- disjoint paths
- constant factor approximation