Minimum spanning tree with hop restrictions

DOI10.1016/S0196-6774(03)00051-8MaRDI QIDQ4458878zbMATH OpenFDO

Authors Refael Hassin, Asaf Levin

Publication date 14 March 2004

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

Full work available at URL https://doi.org/10.1016/S0196-6774(03)00051-8

zbMATH Keywords

Approximation algorithmHop-restrictionMinimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Approximating \(k\)-hop minimum-spanning trees
• scientific article; zbMATH DE number 1947056
• The Steiner tree problem with hop constraints
• Minimum restricted diameter spanning trees.
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem

Cited in

(5)

• Minimum restricted diameter spanning trees.
• Finding bounded diameter minimum spanning tree in general graphs
• Approximating \(k\)-hop minimum-spanning trees
• Light graphs with small routing cost
• On two restricted ancestors tree problems

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

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