Approximating minimum Steiner point trees in Minkowski planes
From MaRDI portal
Publication:3064040
DOI10.1002/net.20376zbMath1206.90199arXiv1307.2987WikidataQ61714618 ScholiaQ61714618MaRDI QIDQ3064040
Marcus Brazil, Charl J. Ras, Doreen Anne Thomas
Publication date: 20 December 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.2987
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Minimal Steiner trees for rectangular arrays of lattice points
- Approximation schemes for NP-hard geometric optimization problems: a survey
- The Fermat--Torricelli problem in normed planes and spaces
- Canonical forms and algorithms for Steiner trees in uniform orientation metrics
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Bottleneck Steiner trees in the plane
- Steiner Minimal Trees
- Approximations for Steiner trees with minimum number of Steiner points
- Wire segmenting for buffer insertion based on RSTP-MSP