scientific article; zbMATH DE number 2079369
From MaRDI portal
Publication:4471328
Recommendations
Cited in
(19)- A polynomial kernel for distance-hereditary vertex deletion
- Beating the 2-approximation factor for global bicut
- Greedy approximation algorithms for directed multicuts
- On the advantage of overlapping clusters for minimizing conductance
- Register loading via linear programming
- The multi-multiway cut problem
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut
- The checkpoint problem
- On the Max-flow min-cut ratio for directed multicommodity flows
- Approximation and kernelization for chordal vertex deletion
- Enabling cuts on multiresolution representation
- \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
- Approximating multicut and the demand graph
- Approximation and Online Algorithms
- Approximating directed multicuts
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
- A lower bound on the integrality gap for minimum multicut in directed networks
- A 2-approximation algorithm for the directed multiway cut problem
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471328)
