Lasserre Integrality Gaps for Graph Spanners and Related Problems
arXiv: Computational Complexity, 2019.
There has been significant recent progress on algorithms for approximating graph spanners, i.e., algorithms which approximate the best spanner for a given input graph. Essentially all of these algorithms use the same basic LP relaxation, so a variety of papers have studied the limitations of this approach and proved integrality gaps for...More
PPT (Upload PPT)