Actualité


Parameterized optimization: going beyond treewidth?

13 juin 2013

Vendredi 14 juin 2013, 14h, en salle 201, Binh Minh Bui Xuan, chargé de recherche au LIP6 (joint work with J.-F. Raymond and P. Trebuchet)

A major trend in parameterized algorithms aims at solving NP-hard graph problems in two steps: (1) recursively divide the input graph into chunks not increasing the value of a certain "width" parameter; (2) solve the NP-hard problem at hand along the chunk divisions. The two stage divide-and-conquer paradigm is commonly addressed as (1) finding good heuristics/approximation for the width parameter; (2) dynamic programming solving the NP-hard problem at hand .

UPJV