Approximations and lower bounds for the length of minimal Euclidean Steiner trees
From MaRDI portal
Publication:2457920
DOI10.1007/s10898-005-4207-8zbMath1133.90408MaRDI QIDQ2457920
Nicholas C. Wormald, Joachim Hyam Rubinstein, Jia Feng Weng
Publication date: 23 October 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-4207-8
90C35: Programming involving graphs or networks
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
54F50: Topological spaces of dimension (leq 1); curves, dendrites
Related Items
Cites Work