Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.
Peyman AfshaniHamed HatamiPublished in: Inf. Process. Lett. (2008)
Keyphrases
- maximum clique
- high dimensions
- approximation algorithms
- branch and bound algorithm
- association graph
- high dimensional data
- high dimensional
- maximal cliques
- np hard
- computational biology
- graph theory
- high dimensional spaces
- special case
- poor quality
- data sets
- lower bound
- neural network
- graph theoretic
- worst case
- computer vision
- graph mining
- polynomial time approximation
- search algorithm