Approximate greedy clustering and distance selection for graph metrics
In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics. The first of these problems is the greedy permut...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Carleton University
2020-12-01
|
| Col·lecció: | Journal of Computational Geometry |
| Accés en línia: | https://jocg.org/index.php/jocg/article/view/3115 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|