Minimum spanning tree with hop restrictions

DOI10.1016/S0196-6774(03)00051-8zbMath1084.68141MaRDI QIDQ4458878

Refael Hassin, Asaf Levin

Publication date: 14 March 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

Approximation algorithmMinimum spanning treeHop-restriction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (2)

Finding bounded diameter minimum spanning tree in general graphs ⋮ Approximating \(k\)-hop minimum-spanning trees

This page was built for publication: Minimum spanning tree with hop restrictions