Approximation algorithms for quickest spanning tree problems

DOI10.1007/S00453-004-1118-XMaRDI QIDQ1763146zbMATH OpenOpenAlexFDO

Authors Refael Hassin, Asaf Levin

Publication date 21 February 2005

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1118-x

zbMATH Keywords

Approximation algorithmsMinimum diameter spanning tree problemQuickest path problem

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Algorithms – ESA 2004
• Approximation algorithms for some optimum communication spanning tree problems
• scientific article; zbMATH DE number 4097419
• scientific article; zbMATH DE number 1947056
• Approximation algorithms for the shortest total path length spanning tree problem

Cited in

(10)

• Approximation algorithms for some optimum communication spanning tree problems
• A fast algorithm for source-wise round-trip spanners
• On approximating tree spanners that are breadth first search trees
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Algorithms – ESA 2004
• Approximation algorithms for somek-source shortest paths spanning tree problems
• Delay-constrained minimum shortest path trees and related problems
• On finding a maximum spanning tree of bounded radius
• On the approximability of robust spanning tree problems

This page was built for publication: Approximation algorithms for quickest spanning tree problems

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