Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
T.-H. Hubert ChanAnand LouisZhihao Gavin TangChenzi ZhangPublished in: J. ACM (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- set cover
- randomized algorithms
- np hardness
- minimum cost
- facility location problem
- open shop
- primal dual
- exact algorithms
- approximation schemes
- constant factor
- spectral decomposition
- precedence constraints
- lower bound
- approximation ratio
- laplacian matrix
- undirected graph
- spanning tree
- search space