Computing the Center of Uncertain Points on Tree Networks
From MaRDI portal
Publication:3449857
DOI10.1007/978-3-319-21840-3_50zbMath1359.68270OpenAlexW2401996954MaRDI QIDQ3449857
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_50
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ A note on computing the center of uncertain data on the real line
Cites Work
- Unnamed Item
- Minmax regret 1-facility location on uncertain path networks
- Facility location problems with uncertainty on the plane
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Convex hulls under uncertainty
- Nearest-neighbor searching under uncertainty. I
- A 1-center problem on the plane with uniformly distributed demand points
- On the Most Likely Convex Hull of Uncertain Points
- One-Dimensional k-Center on Uncertain Data
- On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
- On the Complexity of Some Common Geometric Location Problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Slowing down sorting networks to obtain faster sorting algorithms
- Kinetic 2-centers in the black-box model
- Geometric Computations on Indecisive Points
- Closest Pair and the Post Office Problem for Stochastic Points
- Stochastic minimum spanning trees in euclidean spaces
