Pages that link to "Item:Q685479"
From MaRDI portal
The following pages link to Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479):
Displaying 13 items.
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
