Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds.
Nate VeldtPublished in: ICML (2022)
Keyphrases
- approximation algorithms
- lower bound
- correlation clustering
- np hard
- worst case
- constant factor
- special case
- upper bound
- minimum cost
- randomized algorithms
- vertex cover
- approximation ratio
- integrality gap
- branch and bound algorithm
- optimal solution
- scheduling problem
- primal dual
- branch and bound
- strongly np hard
- hierarchical clustering
- error bounds
- active learning
- greedy algorithm
- lower and upper bounds
- hard constraints
- np complete
- approximation guarantees
- constant factor approximation
- statistical tests
- computational complexity
- objective function