scientific article; zbMATH DE number 1947054

MaRDI QIDQ4411284zbMATH OpenFDO

Authors Joachim Gudmundsson, Sang-Min Park, Chan-Su Shin, Alexander Wolff, Herman Haverkort

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620146.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Facility location and the geometric minimum-diameter spanning tree.
• On the minimum diameter spanning tree problem
• Computing a (1+)-approximate geometric minimum-diameter spanning tree
• Geometric minimum diameter minimum cost spanning tree problem
• Minimum Diameter Spanning Trees and Related Problems

Cited in

(10)

• Facility location and the geometric minimum-diameter spanning tree.
• Computing a (1+)-approximate geometric minimum-diameter spanning tree
• Minimum diameter vertex-weighted Steiner tree
• Minimum diameter cost-constrained Steiner trees
• Farthest-point queries with geometric and combinatorial constraints
• Facility Location in Dynamic Geometric Data Streams
• Geometric minimum diameter minimum cost spanning tree problem
• Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
• Algorithms for the minimum diameter terminal Steiner tree problem
• scientific article; zbMATH DE number 7378709 (Why is no real title available?)

This page was built for publication:

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