Euclidean bounded-degree spanning tree ratios
From MaRDI portal
Publication:5361599
DOI10.1145/777792.777795zbMath1374.68652OpenAlexW1988706875MaRDI QIDQ5361599
Publication date: 29 September 2017
Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/777792.777795
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (7)
What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs ⋮ On improved bounds for bounded degree spanning trees for points in arbitrary dimension ⋮ Using Lagrangian dual information to generate degree constrained spanning trees ⋮ Cooperative TSP ⋮ Algorithms for Euclidean Degree Bounded Spanning Tree Problems ⋮ Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem ⋮ A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
This page was built for publication: Euclidean bounded-degree spanning tree ratios
