Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow
From MaRDI portal
Publication:5874526
Recommendations
- Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank
- Approximate max-integral-flow/min-multicut theorems
- The complementary class of generalized flow cover inequalities
- A measure-theoretical max-flow-min-cut problem
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
- Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
- Tight spans of distances and the dual fractionality of undirected multiflow problems
- Primal-dual approximation algorithms for integral flow and multicut in trees
- scientific article; zbMATH DE number 1099084
Cites work
- A General Approximation Technique for Constrained Forest Problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A primal-dual approximation algorithm for generalized Steiner network problems
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Excluded minors, network decomposition, and multicommodity flow
- Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
- Primal-dual approximation algorithms for integral flow and multicut in trees
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(2)
This page was built for publication: Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874526)
