Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs.
Nate VeldtPublished in: CoRR (2022)
Keyphrases
- learning algorithm
- graph theory
- worst case
- clustering algorithm
- linear programming
- optimization problems
- objective function
- optimal solution
- computational complexity
- data clustering
- combinatorial optimization
- computationally efficient
- demosaicing algorithm
- cluster analysis
- computational cost
- dynamic programming
- np hard
- significant improvement
- high dimensional
- feature space