5 citations · 11 across the 24 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2014
Structural Parameterizations of the Mixed Chinese Postman Problem
Gregory Gutin, Mark Jones, Magnus Wahlstrom
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph ( may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each ed…
cs.CC2014
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
Gregory Gutin, Stefan Kratsch, Magnus Wahlström
The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by…
cs.CC2012
(Non-)existence of Polynomial Kernels for the Test Cover Problem
G. Gutin, G. Muciaccia, A. Yeo
The input of the Test Cover problem consists of a set of vertices, and a collection of distinct subsets of , called tests. A test separates…