scientific article; zbMATH DE number 1947054
From MaRDI portal
Publication:4411284
zbMATH Open1013.90113MaRDI QIDQ4411284FDOQ4411284
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
Title of this publication is not available (Why is that?)
Recommendations
- Facility location and the geometric minimum-diameter spanning tree.
- On the minimum diameter spanning tree problem
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
- Geometric minimum diameter minimum cost spanning tree problem
- Minimum Diameter Spanning Trees and Related Problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (10)
- Farthest-point queries with geometric and combinatorial constraints
- Facility location and the geometric minimum-diameter spanning tree.
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
- Geometric minimum diameter minimum cost spanning tree problem
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Title not available (Why is that?)
- Minimum diameter vertex-weighted Steiner tree
- Minimum diameter cost-constrained Steiner trees
- Facility Location in Dynamic Geometric Data Streams
- Algorithms for the minimum diameter terminal Steiner tree problem
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)
