most citedOn Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2015★ 1 cited

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

Bart M. P. Jansen

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a s…