When crossings count — approximating the minimum spanning tree

DOI10.1145/336154.336197zbMath1375.68143arXivcs/0303001MaRDI QIDQ5361527

Piotr Indyk, Sariel Har-Peled

Publication date: 29 September 2017

Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68W25: Approximation algorithms

52C30: Planar arrangements of lines and pseudolines (aspects of discrete geometry)