Pages that link to "Item:Q1199130"
From MaRDI portal
The following pages link to Transitions in geometric minimum spanning trees (Q1199130):
Displaying 40 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST (Q832851) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Cooperative TSP (Q982655) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Structural tolerance and Delaunay triangulation (Q1606996) (← links)
- Strong matching of points with geometric shapes (Q1699290) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Low-degree minimum spanning trees (Q1895968) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Characterizing proximity trees (Q1920422) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Bounded-angle minimum spanning trees (Q2072102) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST (Q2088886) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- On improved bounds for bounded degree spanning trees for points in arbitrary dimension (Q2250052) (← links)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- (Q2728899) (← links)
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH (Q2790350) (← links)
- md-MST is NP-hard for (Q2883542) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- The Minimum Moving Spanning Tree Problem (Q5886031) (← links)
- Improved algorithms in directional wireless sensor networks (Q6046631) (← links)
- Cut locus realizations on convex polyhedra (Q6110068) (← links)