scientific article; zbMATH DE number 1947054
From MaRDI portal
Publication:4411284
zbMath1013.90113MaRDI QIDQ4411284
Joachim Gudmundsson, Sang-Min Park, Alexander Wolff, Chan-Su Shin, Herman J. Haverkort
Publication date: 7 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620146.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (6)
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Algorithms for the minimum diameter terminal Steiner tree problem ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Minimum diameter vertex-weighted Steiner tree
This page was built for publication:
