One-dimensional \(k\)-center on uncertain data
From MaRDI portal
Publication:497686
DOI10.1016/j.tcs.2015.08.017zbMath1330.90049OpenAlexW1628490320MaRDI QIDQ497686
Publication date: 25 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.017
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)
Related Items (11)
Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ Computing \(k\)-centers of uncertain points on a real line ⋮ r-Gatherings on a star and uncertain r-gatherings on a line ⋮ Clustering with faulty centers ⋮ The two-center problem of uncertain points on a real line ⋮ The \(p\)-center problem under locational uncertainty of demand points ⋮ A note on computing the center of uncertain data on the real line ⋮ Covering uncertain points in a tree ⋮ 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 ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
Cites Work
- Unnamed Item
- Minmax regret 1-facility location on uncertain path networks
- Algebraic optimization: The Fermat-Weber location problem
- Parametric search made practical
- Optimal slope selection via expanders
- Geometric complexity of some location problems
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- The algebraic degree of geometric optimization problems
- Optimal slope selection via cuttings
- Facility location problems with uncertainty on the plane
- A note on searching line arrangements and applications
- Efficient Algorithms for the Weighted k-Center Problem on a Real Line
- On the Complexity of Some Common Geometric Location Problems
- Maximum independent set for intervals by divide and conquer with pruning
- Approximate clustering via core-sets
- On coresets for k-means and k-median clustering
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Polynomially bounded algorithms for locatingp-centers on a tree
- Efficient algorithms for interval graphs and circular-arc graphs
- Slowing down sorting networks to obtain faster sorting algorithms
- Local Search Heuristics for k-Median and Facility Location Problems
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- Closest Pair and the Post Office Problem for Stochastic Points
- Stochastic minimum spanning trees in euclidean spaces
This page was built for publication: One-dimensional \(k\)-center on uncertain data
