Login / Signup
On the parameterized complexity of vertex cover and edge cover with connectivity constraints.
Henning Fernau
Fedor V. Fomin
Geevarghese Philip
Saket Saurabh
Published in:
Theor. Comput. Sci. (2015)
Keyphrases
</>
vertex cover
parameterized complexity
global constraints
precedence constraints
planar graphs
approximation algorithms
partial order
fixed parameter tractable
constraint satisfaction
connected components
lower bound
evaluation function
combinatorial problems