Computing k-centers of uncertain points on a real line
From MaRDI portal
Publication:2157899
Recommendations
Cites work
- A note on searching line arrangements and applications
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
- Clustering geometrically-modeled points in the aggregated uncertainty model
- Computing the rectilinear center of uncertain points in the plane
- Efficient algorithms for interval graphs and circular-arc graphs
- Efficient algorithms for the one-dimensional \(k\)-center problem
- Fast Algorithms for Finding Nearest Common Ancestors
- Fitting a step function to a point set
- scientific article; zbMATH DE number 432817 (Why is no real title available?)
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Interval data minmax regret network optimization problems
- Largest bounding box, smallest diameter, and related problems on imprecise points
- On the Complexity of Some Common Geometric Location Problems
- One-dimensional \(k\)-center on uncertain data
- Stochastic \(k\)-center and \(j\)-flat-center problems
Cited in
(2)
This page was built for publication: Computing \(k\)-centers of uncertain points on a real line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157899)