Stochastic minimum spanning trees in euclidean spaces
From MaRDI portal
Publication:5404409
DOI10.1145/1998196.1998206zbMath1283.68369OpenAlexW2036686829MaRDI QIDQ5404409
Pegah Kamousi, Timothy M. Chan, Subhash Suri
Publication date: 24 March 2014
Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1998196.1998206
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Stochastic programming (90C15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (24)
On the separability of stochastic geometric objects, with applications ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Computing the Center of Uncertain Points on Tree Networks ⋮ Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Convex hulls under uncertainty ⋮ Closest pair and the post office problem for stochastic points ⋮ Clustering with faulty centers ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties ⋮ The Most Likely Object to be Seen Through a Window ⋮ One-dimensional \(k\)-center on uncertain data ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Computing the center of uncertain points on tree networks ⋮ Unnamed Item ⋮ Maximum box problem on stochastic points ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Covering uncertain points in a tree ⋮ The most-likely skyline problem for stochastic points ⋮ Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ Computing Shortest Paths in the Plane with Removable Obstacles ⋮ Expected computations on color spanning sets ⋮ Computing Shapley values in the plane
This page was built for publication: Stochastic minimum spanning trees in euclidean spaces
