An adaptive probabilistic algorithm for online \(k\)-center clustering
From MaRDI portal
Publication:2313750
DOI10.3934/jimo.2018057zbMath1438.90292OpenAlexW2800337750MaRDI QIDQ2313750
Ruiqi Yang, Yicheng Xu, Dongmei Zhang, Da-Chuan Xu
Publication date: 23 July 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018057
Cites Work
- Unnamed Item
- The \(p\)-neighbor \(k\)-center problem
- The fault-tolerant capacitated \(K\)-center problem
- Clustering to minimize the maximum intercluster distance
- Easy and hard bottleneck location problems
- On the power of randomization in on-line algorithms
- Fault tolerant \(K\)-center problems
- Competitive analysis of randomized paging algorithms
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
- A Best Possible Heuristic for the k-Center Problem
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- Incremental Clustering and Dynamic Information Retrieval
- An Algorithm for Online K-Means Clustering
This page was built for publication: An adaptive probabilistic algorithm for online \(k\)-center clustering