Low stretch spanning trees

DOI10.1007/3-540-45687-2_5MaRDI QIDQ4708559zbMATH OpenFDO

Authors David Peleg

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200068.htm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(12)

• Parameterized complexity of the spanning tree congestion problem
• Spanners of bounded degree graphs
• Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
• Low degree spanning trees of small weight
• An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
• Lower-stretch spanning trees
• scientific article; zbMATH DE number 2011838 (Why is no real title available?)
• An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
• Spanners in sparse graphs
• Carousel greedy algorithms for the minimum stretch spanning tree problem
• Bicriteria approximation for minimum dilation graph augmentation
• Giving some slack: shortcuts and transitive closure compressions

This page was built for publication: Low stretch spanning trees

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