Approximating Minimum Max-Stretch spanning Trees on unweighted graphs

Yuval Emek, David Peleg. Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. pages 261-270, SIAM, 2004. [doi]

Abstract

Abstract is missing.