Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones

DOI10.1109/FOCS.2011.18MaRDI QIDQ5494977zbMATH OpenOpenAlexFDO

Authors Michael Elkin, Shay Solomon

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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494977)