Euclidean bounded-degree spanning tree ratios
From MaRDI portal
Publication:1762944
DOI10.1007/S00454-004-1117-3zbMATH Open1066.68092OpenAlexW2002985966MaRDI QIDQ1762944FDOQ1762944
Authors: Timothy M. Chan 
Publication date: 11 February 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-004-1117-3
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (16)
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
- Polynomial area bounds for MST embeddings of trees
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST
- Degree-bounded minimum spanning trees
- Bounded-angle minimum spanning trees
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
- Euclidean bounded-degree spanning tree ratios
- Degree-bounded minimum spanning tree for unit disk graph
- Algorithms for Euclidean degree bounded spanning tree problems
- Euclidean bottleneck bounded-degree spanning tree ratios
- On improved bounds for bounded degree spanning trees for points in arbitrary dimension
- Degree bounded bottleneck spanning trees in three dimensions
- The complexity of symmetric connectivity in directional wireless sensor networks
- Bounded-angle spanning tree: modeling networks with angular constraints
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST
- On the area requirements of Euclidean minimum spanning trees
This page was built for publication: Euclidean bounded-degree spanning tree ratios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762944)
