scientific article
From MaRDI portal
Publication:3689203
zbMath0572.05022MaRDI QIDQ3689203
Fan R. K. Chung, Ronald L. Graham
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Steiner Problem for Count Matroids, Steiner minimal trees for regular polygons, A continuous version of a result of Du and Hwang, Steiner minimal trees on sets of four points, On greedy heuristic for Steiner minimum trees, Mathematical problems and games, An algorithm for determining an opaque minimal forest of a convex polygon, The Steiner problem with edge lengths 1 and 2, Steiner minimal trees in \(L^ 2_ p\), Solving the prize‐collecting Euclidean Steiner tree problem, The Steiner ratio Gilbert-Pollak conjecture is still open, Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\), Geometric multicut: shortest fences for separating groups of objects in the plane, Analytic formulas for full Steiner trees, Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane, Minimum Cost Globally Rigid Subgraphs, A primer of the Euclidean Steiner problem, On Steiner ratio conjectures, The Steiner ratio conjecture for cocircular points, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, How to find Steiner minimal trees in Euclidean \(d\)-space, On Steiner minimal trees with \(L_ p\) distance, On better heuristics for Steiner minimum trees, On the restricted 1-Steiner tree problem, Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem, \(1\)-line minimum rectilinear Steiner trees and related problems, On the restricted \(k\)-Steiner tree problem, Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
