Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
Peng ZhangYao XuTao JiangAngsheng LiGuohui LinEiji MiyanoPublished in: Algorithmica (2018)
Keyphrases
- approximation algorithms
- vertex cover
- undirected graph
- randomized algorithms
- np hard
- special case
- exact algorithms
- np hardness
- worst case
- approximation schemes
- primal dual
- practical problems
- precedence constraints
- network design problem
- minimum cost
- metaheuristic
- facility location problem
- constant factor
- learning algorithm