Approximating the k-multicut problem
From MaRDI portal
Publication:3581503
Cited in
(20)- An FPT algorithm for planar multicuts with sources and sinks on the outer face
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
- On the parameterized complexity of separating certain sources from the target
- Thresholded covering algorithms for robust and max-min optimization
- An approximation algorithm for the generalized k-multicut problem
- Evader interdiction: algorithms, complexity and collateral damage
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Approximation Algorithms for k-Hurdle Problems
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set
- Approximation algorithms for \(k\)-hurdle problems
- A unified approach to approximating partial covering problems
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties
- On the dominant of the multicut polytope
- Search-space reduction via essential vertices revisited: vertex multicut and cograph deletion
- Search-space reduction via essential vertices revisited: vertex multicut and cograph deletion
- The checkpoint problem
- Approximation algorithms for the partition vertex cover problem
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- Partial multicuts in trees
This page was built for publication: Approximating the k-multicut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581503)
