A constant approximation algorithm for the densest k.
Maria LiaziIoannis MilisVassilis ZissimopoulosPublished in: Inf. Process. Lett. (2008)
Keyphrases
- worst case
- objective function
- times faster
- recognition algorithm
- detection algorithm
- search space
- computational cost
- learning algorithm
- approximation ratio
- preprocessing
- dynamic programming
- experimental evaluation
- matching algorithm
- np hard
- significant improvement
- computational complexity
- cost function
- improved algorithm
- optimal solution
- clustering method
- theoretical analysis
- high accuracy
- input data
- tree structure
- search algorithm
- data structure
- k means
- neural network
- similarity measure
- polynomial time approximation