Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones

DOI10.1109/FOCS.2011.18zbMath1292.68124OpenAlexW2082635360MaRDI QIDQ5494977

Shay Solomon, Michael Elkin

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.18

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Truly Optimal Euclidean Spanners ⋮ Terminal embeddings ⋮ Average stretch factor: how low does it go?

This page was built for publication: Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones