Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951)
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: Polynomial time approximation schemes for clustering in low highway dimension graphs |
scientific article; zbMATH DE number 7396419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time approximation schemes for clustering in low highway dimension graphs |
scientific article; zbMATH DE number 7396419 |
Statements
Polynomial time approximation schemes for clustering in low highway dimension graphs (English)
0 references
17 September 2021
0 references
approximation algorithm
0 references
highway dimension
0 references
clustering
0 references
0 references
0 references
0 references
0.9999991059303284
0 references
0.8342786431312561
0 references
0.8145939707756042
0 references
0.8140309453010559
0 references
0.7995248436927795
0 references
