Transitions in geometric minimum spanning trees
From MaRDI portal
(Redirected from Publication:1199130)
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A Fast Parametric Maximum Flow Algorithm and Applications
- A data structure for dynamic trees
- Computing Euclidean maximum spanning trees
- Fast Algorithms for Finding Nearest Common Ancestors
- New upper bounds for neighbor searching
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Optimal attack and reinforcement of a network
- Parametric Combinatorial Computing and a Problem of Program Module Distribution
- Parametric stable marriage and minimum cuts
- Selected Applications of Minimum Cuts in Networks
- Some dynamic computational geometry problems
- The 1-steiner tree problem
Cited in
(53)- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
- On the Topologies of Local Minimum Spanning Trees
- Polynomial area bounds for MST embeddings of trees
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST
- The minimum moving spanning tree problem
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- Degree-bounded minimum spanning trees
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Drawing a tree as a minimum spanning tree approximation
- Succinct greedy drawings do not always exist
- Cut locus realizations on convex polyhedra
- Proximity drawings in polynomial area and volume
- Polynomial Area Bounds for MST Embeddings of Trees
- Cooperative TSP
- The Minimum Moving Spanning Tree Problem
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- On the restricted 1-Steiner tree problem
- On the restricted \(k\)-Steiner tree problem
- Characterizing proximity trees
- The realization problem for Euclidean minimum spanning trees is NP-hard
- Bounded-angle minimum spanning trees
- Improved algorithms in directional wireless sensor networks
- Low-degree minimum spanning trees
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
- On nearest-neighbor graphs
- The geometry of inner spanning trees for planar polygons
- scientific article; zbMATH DE number 1629854 (Why is no real title available?)
- Drawing graphs as spanners
- Voronoi drawings of trees
- Using Lagrangian dual information to generate degree constrained spanning trees
- On partitioning minimum spanning trees
- Degree-bounded minimum spanning tree for unit disk graph
- Approximating the bottleneck plane perfect matching of a point set
- md-MST is NP-hard for \(d\geq 3\)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- On the number of minimal 1-Steiner trees
- Generalised \(k\)-Steiner tree problems in normed planes
- Algorithms for Euclidean degree bounded spanning tree problems
- Euclidean bottleneck bounded-degree spanning tree ratios
- Structural tolerance and Delaunay triangulation
- On minimum and maximum spanning trees of linearly moving points
- On improved bounds for bounded degree spanning trees for points in arbitrary dimension
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- Witness (Delaunay) graphs
- Proximity drawings of high-degree trees
- Degree bounded bottleneck spanning trees in three dimensions
- Strong matching of points with geometric shapes
- The drawability problem for minimum weight triangulations
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
- 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: Transitions in geometric minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199130)
