Approximating minimum Steiner point trees in Minkowski planes

DOI10.1002/net.20376zbMath1206.90199arXiv1307.2987OpenAlexW1980159248WikidataQ61714618 ScholiaQ61714618MaRDI QIDQ3064040

Charl J. Ras, Doreen Anne Thomas, Marcus Brazil

Publication date: 20 December 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2987

zbMATH Keywords

bounded edge-length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)

Related Items (2)

A geometric characterisation of the quadratic min-power centre ⋮ Approximate Euclidean Steiner trees

Cites Work

• 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
• Euclidean Steiner minimum trees: An improved exact algorithm
• 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
• Unnamed Item

This page was built for publication: Approximating minimum Steiner point trees in Minkowski planes