Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters.
Hans L. BodlaenderCarla GroenlandMichal PilipczukPublished in: ICALP (2023)
Keyphrases
- vertex cover
- parameterized complexity
- approximation algorithms
- constraint satisfaction
- constraint satisfaction problems
- parameter estimation
- planar graphs
- partial order
- maximum likelihood
- global constraints
- search algorithm
- expectation maximization
- random variables
- bayesian networks
- constraint programming
- constraint propagation
- np hard