A note on computing the center of uncertain data on the real line
From MaRDI portal
Publication:1790197
DOI10.1016/j.orl.2016.03.009zbMath1408.90168OpenAlexW2303014626MaRDI QIDQ1790197
Publication date: 2 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.03.009
Related Items (5)
Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ The two-center problem of uncertain points on a real line ⋮ Computing the center of uncertain points on cactus graphs ⋮ An O(n log n)-Time Algorithm for the k-Center Problem in Trees ⋮ An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
Cites Work
- Unnamed Item
- Minmax regret 1-facility location on uncertain path networks
- One-dimensional \(k\)-center on uncertain data
- Efficient algorithms for the one-dimensional \(k\)-center problem
- Facility location problems with uncertainty on the plane
- A 1-center problem on the plane with uniformly distributed demand points
- On the Complexity of Some Common Geometric Location Problems
- Computing the Center of Uncertain Points on Tree Networks
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- Polynomially bounded algorithms for locatingp-centers on a tree
- Minimax regret p-center location on a network with demand uncertainty
- Slowing down sorting networks to obtain faster sorting algorithms
This page was built for publication: A note on computing the center of uncertain data on the real line
