Steiner minimal trees with one polygonal obstacle.

DOI10.1007/s00453-001-0002-1zbMath1054.90064OpenAlexW2023876413MaRDI QIDQ5943667

James MacGregor Smith, Jia Feng Weng

Publication date: 22 September 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0002-1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Maximising the worth of nascent networks

This page was built for publication: Steiner minimal trees with one polygonal obstacle.