NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors.
Amey BhangalePublished in: ICALP (2018)
Keyphrases
- np hardness
- np hard
- approximation algorithms
- color images
- worst case analysis
- color space
- discrete tomography
- higher order
- sample complexity
- optimal solution
- special case
- mixed integer
- lower bound
- linear programming
- computational complexity
- pairwise
- scheduling problem
- hypergraph model
- decision problems
- particle swarm optimization
- worst case
- upper bound