Login / Signup
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.
Daniel Lokshtanov
M. S. Ramanujan
Saket Saurabh
Meirav Zehavi
Published in:
CoRR (2017)
Keyphrases
</>
parameterized complexity
fixed parameter tractable
global constraints
approximation algorithms
np complete
symmetry breaking
np hard
computational problems
database
knowledge base
search algorithm
constraint satisfaction problems