arXiv
Open Access
2019
On ultrametric $1$-median selection
Ching-Lueh Chang
Abstrak
Consider the problem of finding a point in an ultrametric space with the minimum average distance to all points. We give this problem a Monte Carlo $O((\log^2(1/ε))/ε^3)$-time $(1+ε)$-approximation algorithm for all $ε>0$.
Topik & Kata Kunci
Penulis (1)
C
Ching-Lueh Chang
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2019
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓