Locally minimal uniformly oriented shortest networks

DOI10.1016/j.dam.2005.04.021zbMath1275.90114OpenAlexW2094722234WikidataQ61714628 ScholiaQ61714628MaRDI QIDQ858304

Marcus Brazil, Jia Feng Weng, Doreen Anne Thomas

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.021

zbMATH Keywords

Steiner treelambda-networklocally minimal network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (5)

The length of an extremal network in a normed space: Maxwell formula ⋮ Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$ ⋮ Computing Steiner points for gradient-constrained minimum networks ⋮ COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ₁ AND ℓ₂ METRIC SPACES ⋮ Steiner trees for fixed orientation metrics

Cites Work

• The Steiner tree problem
• Minimum Networks in Uniform Orientation Metrics
• On Some Distance Problems in Fixed Orientations
• Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
• Reducing the Steiner Problem in a Normed Space

This page was built for publication: Locally minimal uniformly oriented shortest networks