Geometric Minimum Diameter Minimum Cost Spanning Tree Problem

DOI10.1007/978-3-642-10631-6_30zbMath1272.05207OpenAlexW1561849181MaRDI QIDQ3652215

Tien-Ching Lin, Dae Young Seo, Der-Tsai Lee

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_30

zbMATH Keywords

geometric optimization problemsminimum diameter minimum cost spanning tree problemminimum radius minimum cost spanning tree problem

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Delay-constrained minimum shortest path trees and related problems ⋮ Delay-constrained minimum shortest path trees and related problems

This page was built for publication: Geometric Minimum Diameter Minimum Cost Spanning Tree Problem