no code implementations • 19 Apr 2016 • Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin, Andrei Gagarin
We also introduce new pseudo-Boolean (PB) and Constraint Satisfaction (CSP) formulations of the WSP with UI constraints which efficiently exploit this new decomposition of the problem and raise the novel issue of how to use general-purpose solvers to tackle FPT problems in a fashion that meets FPT efficiency expectations.
