Minimum restricted diameter spanning trees.

DOI10.1016/S0166-218X(03)00360-3zbMath1095.90094MaRDI QIDQ1427810

Asaf Levin, Refael Hassin

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimizationApproximation algorithmsMinimum diameter spanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

Reconfiguration of spanning trees with degree constraints or diameter constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum diameter spanning tree problem
• Designing multi-commodity flow trees
• Parallel concepts in graph theory
• Call routing and the ratcatcher
• A Graph-Theoretic Game and Its Application to the k-Server Problem