Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs.
Andreas Emil FeldmannDavid SaulpicPublished in: CoRR (2020)
Keyphrases
- approximation schemes
- approximation algorithms
- graph theoretic
- graph clustering
- clustering method
- clustering algorithm
- k means
- polynomial time complexity
- special case
- graph isomorphism
- computational complexity
- graph partitioning
- graph construction
- graph theory
- graph matching
- graph model
- graph mining
- spectral clustering
- high dimensional data
- np complete
- higher order
- worst case
- np hard
- high dimension
- bounded treewidth
- search algorithm
- objective function