38 citations · 173 across the 47 of their papers we have counts for
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010
Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems
Gregory Gutin, Mark Jones, Anders Yeo
In the {\sc Hitting Set} problem, we are given a collection of subsets of a ground set and an integer , and asked whether has a -element subset that intersec…
cs.DS2010★ 2 cited
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications
R. Crowston, G. Gutin, M. Jones +1
A pair of unit clauses is called conflicting if it is of the form , . A CNF formula is unit-conflict free (UCF) if it contains no pair of conflicting unit clauses.…