Geometric minimum diameter minimum cost spanning tree problem

DOI10.1007/978-3-642-10631-6_30MaRDI QIDQ3652215zbMATH OpenOpenAlexFDO

Authors Dae Young Seo, Tien-Ching Lin, 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) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 1947056
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• scientific article; zbMATH DE number 1947054
• Facility location and the geometric minimum-diameter spanning tree.

Cited in

(5)

• Facility location and the geometric minimum-diameter spanning tree.
• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 1947054 (Why is no real title available?)
• 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

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