| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652339 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
We show that the multicut problem is APX-hard in directed acyclic graphs, even with three source-sink pairs. We also show that it is tractable in planar graphs with a fixed number of terminals, and even FPT if all the terminals lie on the outer face.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
