Stochastic minimum spanning trees in euclidean spaces
DOI10.1145/1998196.1998206zbMATH Open1283.68369OpenAlexW2036686829MaRDI QIDQ5404409FDOQ5404409
Subhash Suri, Pegah Kamousi, Timothy M. Chan
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)
Cited In (27)
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Computing Shortest Paths in the Plane with Removable Obstacles
- Maximum box problem on stochastic points
- On the separability of stochastic geometric objects, with applications
- Computing Shapley values in the plane
- Covering uncertain points in a tree
- On the expected diameter, width, and complexity of a stochastic convex hull
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Expected computations on color spanning sets
- Convex hulls under uncertainty
- The Most Likely Object to be Seen Through a Window
- On the arrangement of stochastic lines in \(\mathbb{R}^2\)
- Interval elimination method for stochastic spanning tree problem
- Clustering with faulty centers
- Title not available (Why is that?)
- One-dimensional \(k\)-center on uncertain data
- Half-plane point retrieval queries with independent and dependent geometric uncertainties
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- The most-likely skyline problem for stochastic points
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Computing the Center of Uncertain Points on Tree Networks
- Title not available (Why is that?)
- Computing the center of uncertain points on tree networks
- Closest pair and the post office problem for stochastic points
- Computing the Rectilinear Center of Uncertain Points in the Plane
This page was built for publication: Stochastic minimum spanning trees in euclidean spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404409)
