A Faster Algorithm for Vertex Cover Parameterized by Solution Size.
David G. HarrisN. S. NarayanaswamyPublished in: STACS (2024)
Keyphrases
- vertex cover
- computational complexity
- theoretical analysis
- brute force search
- np hard
- search space
- dynamic programming
- optimal solution
- learning algorithm
- objective function
- approximation algorithms
- integer programming
- lower bound
- expectation maximization
- shortest path
- closed form
- combinatorial optimization
- precedence constraints
- constant factor