scientific article; zbMATH DE number 2119700
From MaRDI portal
Publication:4828971
zbMath1140.90529MaRDI QIDQ4828971
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Mathematical programming (90C99)
Related Items (6)
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Facility location and the geometric minimum-diameter spanning tree. ⋮ Algorithms for the minimum diameter terminal Steiner tree problem ⋮ Minimum diameter vertex-weighted Steiner tree ⋮ Computing Klee's measure of grounded boxes
This page was built for publication:
