Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
Complexity and Exact Algorithms for Mulitcut
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
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