Approximation algorithms for maximum weight k-coverings of graphs by packings.
Fanica GavrilMordechai ShalomShmuel ZaksPublished in: Discret. Math. Algorithms Appl. (2022)
Keyphrases
- approximation algorithms
- maximum weight
- np hard
- independent set
- bipartite graph
- weighted graph
- undirected graph
- special case
- minimum cost
- minimum weight
- worst case
- vertex cover
- partial order
- approximation ratio
- optimal solution
- lower bound
- scheduling problem
- graph matching
- minimum spanning tree
- branch and bound algorithm
- constant factor
- approximation guarantees
- precedence constraints
- linear programming
- randomized algorithms
- link prediction
- spanning tree
- genetic algorithm
- disjoint paths
- constant factor approximation