A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs.
Dmitry B. MokeevDmitriy S. MalyshevPublished in: Optim. Lett. (2020)
Keyphrases
- vertex cover
- dynamic programming
- worst case
- computational complexity
- polynomial time approximation
- approximation algorithms
- np hard
- objective function
- learning algorithm
- minimum cost
- planar graphs
- optimal solution
- probabilistic model
- spanning tree
- simulated annealing
- em algorithm
- point sets
- branch and bound
- lower bound
- bin packing