Approximation Algorithms for Steiner and Directed Multicuts
From MaRDI portal
Recommendations
Cited in
(26)- On approximability of optimization problems related to red/blue-split graphs
- Extended cuts
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- scientific article; zbMATH DE number 2038710 (Why is no real title available?)
- scientific article; zbMATH DE number 2079369 (Why is no real title available?)
- Approximating multicut and the demand graph
- Constant congestion routing of symmetric demands in planar directed graphs
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
- Greedy approximation algorithms for directed multicuts
- The Steiner k-Cut Problem
- Approximation and Online Algorithms
- Approximating Requirement Cut via a Configuration LP
- Approximation algorithms for feasible cut and multicut problems
- Approximations for the Steiner multicycle problem
- The complexity of König subgraph problems and above-guarantee vertex cover
- Multiway cuts with a choice of representatives
- On the complexity of winner determination and strategic control in conditional approval voting
- On the parameterized complexity of symmetric directed multicut
- Multiway cuts with a choice of representatives
- Min-CSPs on complete instances. II: Polylogarithmic approximation for Min-NAE-3-SAT
- Approximation algorithms for requirement cut on graphs
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs
- An improved approximation algorithm for requirement cut
- Approximation algorithms for the Bipartite Multicut problem
This page was built for publication: Approximation Algorithms for Steiner and Directed Multicuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128195)
