📚
📚
The Cartographer
On ultrametric $1$-median selection
September 05, 2019 · Declared Dead · 🏛 Theoretical Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ching-Lueh Chang
arXiv ID
1909.02400
Category
cs.DS: Data Structures & Algorithms
Citations
0
Venue
Theoretical Computer Science
Last Checked
5 months ago
Abstract
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$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Data Structures & Algorithms
R.I.P.
👻
Ghosted
Route Planning in Transportation Networks
R.I.P.
👻
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
👻
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
👻
Ghosted
Graph Isomorphism in Quasipolynomial Time
📚
📚
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted