Abstract
The talk will provide an overview of problems and results concerning spanning trees with low maximum or average stretch and trees with low communication cost, in weighted or unweighted graphs and in metrics, and outline some techniques for dealing with these problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2003). Spanning Trees with Low Maximum/Average Stretch. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive