Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast approximation algorithms for p-centers in large -hyperbolic graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs |
scientific article |
Statements
Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (English)
0 references
18 October 2018
0 references
\(p\)-centers
0 references
clustering
0 references
delta-hyperbolicity
0 references
0 references
0.9957288503646852
0 references
0.8138991594314575
0 references
0.8089462518692017
0 references
0.7890899181365967
0 references
