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