Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs.
Nate VeldtPublished in: ICML (2023)
Keyphrases
- approximation algorithms
- worst case
- np hard
- disjoint paths
- minimum cost
- undirected graph
- primal dual
- constant factor
- optimal solution
- linear programming
- special case
- quadratic program
- network design problem
- clustering algorithm
- vertex cover
- facility location problem
- approximation ratio
- linear program
- approximation schemes
- np hardness
- lower bound
- upper bound
- error bounds
- data points
- greedy algorithm
- constant factor approximation
- computational complexity
- approximation guarantees
- open shop
- greedy heuristic
- set cover
- weighted graph
- strongly np hard
- branch and bound
- network flow
- integrality gap