Lasserre Integrality Gaps for Graph Spanners and Related Problems

Yasamin Nazari
Yasamin Nazari
Zeyu Zhang
Zeyu Zhang

arXiv: Computational Complexity, 2019.

Cited by: 0|Bibtex|Views4|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments