An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs.
Nikolai KarpovMarcin PilipczukAnna Zych-PawlewiczPublished in: Algorithmica (2019)
Keyphrases
- planar graphs
- lower bound
- upper bound
- partition function
- branch and bound algorithm
- lower and upper bounds
- upper and lower bounds
- branch and bound
- optimal solution
- linear programming relaxation
- np hard
- worst case
- objective function
- approximate inference
- binary variables
- minimum weight
- undirected graph
- sample complexity
- connected components
- lagrangian relaxation