Computing the center of uncertain points on tree networks
From MaRDI portal
Publication:527423
DOI10.1007/s00453-016-0158-3zbMath1360.68793OpenAlexW2345659331MaRDI QIDQ527423
Publication date: 11 May 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0158-3
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
The two-center problem of uncertain points on a real line, The \(p\)-center problem under locational uncertainty of demand points, Computing the center of uncertain points on cactus graphs, Covering uncertain points in a tree
Cites Work
- Unnamed Item
- Unnamed Item
- Minmax regret 1-facility location on uncertain path networks
- Facility location problems with uncertainty on the plane
- Some variations on constrained minimum enclosing circle problem
- 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
- Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane
- On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
- THE ALIGNED K-CENTER PROBLEM
- On the Complexity of Some Common Geometric Location Problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
- 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
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Minimax regret p-center location on a network with demand uncertainty
- 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
