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]
@inproceedings{EmekP04,
title = {Approximating Minimum Max-Stretch spanning Trees on unweighted graphs},
author = {Yuval Emek and David Peleg},
year = {2004},
doi = {10.1145/982792.982829},
url = {http://doi.acm.org/10.1145/982792.982829},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/EmekP04},
cites = {0},
citedby = {0},
pages = {261-270},
booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004},
editor = {J. Ian Munro},
publisher = {SIAM},
}