Stochastic minimum spanning trees in Euclidean spaces

DOI10.1145/1998196.1998206MaRDI QIDQ5404409zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

geometric data structuresstochastic minimum spanning trees

Mathematics Subject Classification ID

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)

Recommendations

• Stochastic minimum spanning trees and related problems
• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
• The probabilistic minimum spanning tree problem
• Minimum Spanning Trees in k-Dimensional Space
• On Two-Stage Stochastic Minimum Spanning Trees

Cited in

(28)

• scientific article; zbMATH DE number 1750458 (Why is no real title available?)
• Euclidean minimum spanning trees with independent and dependent geometric uncertainties
• Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
• On minimum- and maximum-weight minimum spanning trees with neighborhoods
• Maximum box problem on stochastic points
• On the separability of stochastic geometric objects, with applications
• Computing Shapley values in the plane
• Computing the center of uncertain points on tree networks
• 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
• Computing shortest paths in the plane with removable obstacles
• Stochastic minimum spanning trees and related problems
• The Most Likely Object to be Seen Through a Window
• Computing the rectilinear center of uncertain points in the plane
• On the arrangement of stochastic lines in \(\mathbb{R}^2\)
• On minimum-and maximum-weight minimum spanning trees with neighborhoods
• Interval elimination method for stochastic spanning tree problem
• Clustering with faulty centers
• scientific article; zbMATH DE number 7559220 (Why is no real title available?)
• One-dimensional \(k\)-center on uncertain data
• More efficient algorithms for stochastic diameter and some unapproximated problems in metric space
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• The most-likely skyline problem for stochastic points
• Half-plane point retrieval queries with independent and dependent geometric uncertainties
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
• Closest pair and the post office problem for stochastic points
• Computing the center of uncertain points on tree networks

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)