Algorithms and hardness results for happy coloring problems.
N. R. AravindSubrahmanyam KalyanasundaramAnjeneya Swami KareJuho LauriPublished in: CoRR (2017)
Keyphrases
- optimization problems
- related problems
- benchmark problems
- run times
- np complete
- computational complexity
- computational cost
- computationally efficient
- orders of magnitude
- test problems
- inference problems
- hard problems
- greedy algorithms
- specific problems
- problems in computer vision
- convex optimization problems
- partial solutions
- practical problems
- years ago
- heuristic methods
- combinatorial optimization
- machine learning
- neural network
- difficult problems
- learning theory
- search methods
- exact algorithms
- computational geometry
- np hardness
- times faster
- theoretical analysis
- significant improvement
- computationally hard
- np hard problems
- objective function