arXiv Open Access 2015

A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection

Ching-Lueh Chang

Lihat Sumber

Abstrak

We give a deterministic $O(hn^{1+1/h})$-time $(2h)$-approximation nonadaptive algorithm for $1$-median selection in $n$-point metric spaces, where $h\in\mathbb{Z}^+\setminus\{1\}$ is arbitrary. Our proof generalizes that of Chang.

Topik & Kata Kunci

cs.DS

Penulis (1)

Ching-Lueh Chang

Format Sitasi

APA MLA BibTeX

Chang, C. (2015). A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection. https://arxiv.org/abs/1502.06764

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓