A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut.
Vincent Cohen-AddadAnupam GuptaPhilip N. KleinJason LiPublished in: CoRR (2021)
Keyphrases
- integrality gap
- linear programming relaxation
- approximation algorithms
- planar graphs
- linear program
- approximation error
- valid inequalities
- linear programming
- planar surfaces
- computer vision
- approximation ratio
- lower bound
- queueing networks
- error bounds
- closed form
- approximation methods
- error tolerance
- arbitrarily close