The Gap Between the Greedy Algorithm and Minimum Multiplicative Spanners: When is the Greedy Algorithm Universally Optimal?

This paper investigates the conditions under which the greedy algorithm for constructing graph spanners is universally optimal, meaning it can produce a minimum k-spanner for any input graph.