Login / Signup
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree.
Jaroslaw Byrka
Fabrizio Grandoni
Afrouz Jabal Ameli
Published in:
STOC (2020)
Keyphrases
</>
steiner tree
linear programming relaxation
minimum spanning tree
facility location
approximation algorithms
connected components
shortest path
spanning tree