Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs.
Andreas Emil FeldmannDavid SaulpicPublished in: ESA (2020)
Keyphrases
- approximation schemes
- approximation algorithms
- graph theoretic
- graph clustering
- clustering algorithm
- k means
- special case
- clustering method
- high dimension
- graph model
- graph isomorphism
- graph partitioning
- graph construction
- worst case
- polynomial time complexity
- graph matching
- spectral clustering
- data points
- np hard
- weighted graph
- graph theory
- bipartite graph
- data clustering
- high dimensional
- multiscale