Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
T.-H. Hubert ChanAnand LouisZhihao Gavin TangChenzi ZhangPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- constant factor
- set cover
- network design problem
- facility location problem
- spectral decomposition
- approximation ratio
- exact algorithms
- approximation schemes
- open shop
- randomized algorithms
- primal dual
- disjoint paths
- np hardness
- precedence constraints
- computational complexity
- spectral analysis
- undirected graph
- combinatorial auctions
- scheduling problem
- lower bound