Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1141.68535OpenAlexW3010016474MaRDI QIDQ5394243FDOQ5394243

Authors: Masaki Okita, Kazuo Iwama, Andrzej Lingas 

Publication date: 25 October 2006

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

Full work available at URL: https://doi.org/10.1007/11534273

Recommendations

• Max-stretch reduction for tree spanners
• Tree Spanners
• Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
• scientific article; zbMATH DE number 1262806
• Approximating minimum MAX-stretch spanning trees on unweighted graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (1)

• Max-stretch reduction for tree spanners

This page was built for publication: Algorithms and Data Structures

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