Approximation algorithms for quickest spanning tree problems

DOI10.1007/S00453-004-1118-XzbMath1082.68127OpenAlexW2103791190MaRDI QIDQ1763146

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)

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