← Search

Wim Van Den Broeck

2 accepted papers

2024

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms

IJCAI 2024poster

Vertex Subset Problems (VSPs) are a class of combinatorial optimization problems on graphs where the goal is to find a subset of vertices satisfying a predefined condition. Two prominent approaches for solving VSPs are dynamic programming over tree-like structures, such as tree-decompositions or cli…

Cited by 0SourcePDFScholar