Stochastic k-Center and j-Flat-Center Problems

DOI10.1137/1.9781611974782.8zbMath1411.68192arXiv1607.04989OpenAlexW2950813123MaRDI QIDQ4575742

Jian Li, Lingxiao Huang

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.04989

Mathematics Subject Classification ID

Stochastic programming (90C15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (11)

On the separability of stochastic geometric objects, with applications ⋮ Unnamed Item ⋮ Computing \(k\)-centers of uncertain points on a real line ⋮ Clustering with faulty centers ⋮ The two-center problem of uncertain points on a real line ⋮ Computing the center of uncertain points on cactus graphs ⋮ Covering uncertain points in a tree ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling ⋮ 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

This page was built for publication: Stochastic k-Center and j-Flat-Center Problems