Minimizing the size of the uncertainty regions for centers of moving entities
From MaRDI portal
Publication:6547939
DOI10.1007/978-3-031-55598-5_18MaRDI QIDQ6547939
Seyed Ali Tabatabaee, William Evans
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Clustering large graphs via the singular value decomposition
- Efficient update strategies for geometric computing with uncertainty
- The algebraic degree of geometric optimization problems
- On the problem to construct the minimum circle enclosing \(n\) given points in a plane.
- Pinwheel scheduling: Achievable densities
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- Computing the median with uncertainty
- On the Complexity of Some Common Geometric Location Problems
- Two Algorithms for the Minimum Enclosing Ball Problem
- Approximate clustering via core-sets
- Windows scheduling as a restricted version of bin packing
- A Best Possible Heuristic for the k-Center Problem
- Windows Scheduling Problems for Broadcast Systems
- A local search approximation algorithm for k-means clustering
- Least squares quantization in PCM
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- Competitive query strategies for minimising the ply of the potential locations of moving points
- Geometric median in nearly linear time
This page was built for publication: Minimizing the size of the uncertainty regions for centers of moving entities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547939)
