Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Introduction RVMC in Trees RVMC in Interval Graphs RVMC in General Graphs ConclusionFixed-parameter tractabilityIdeaRestrict the seemingly inherent combinatorial explosion of hardproblems to some problem-specific parameters.nknkDefinition (fixed-parameter tractable)Problem P is fixed-parameter tractable⇐⇒P is solvable in O(f (k) · n c ) time
Change language