Colored Non-crossing Euclidean Steiner Forest

DOI10.1007/978-3-662-48971-0_37zbMath1472.68109arXiv1509.05681OpenAlexW2963509280MaRDI QIDQ3459881

Philipp Kindermann, Krzysztof Fleszar, Sergey Pupyrev, Sergey Bereg, Alexander Wolff, Joachim Spoerhase

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items

Short plane supports for spatial hypergraphs, Short Plane Supports for Spatial Hypergraphs, Non-crossing geometric steiner arborescences