Algorithms for 2-Route Cut Problems
From MaRDI portal
Recommendations
- Algorithms for the constrained two-staged two-dimensional cutting problem
- A cutting plane algorithm for the general routing problem
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Approximation algorithms and hardness of the \(k\)-route cut problem
- A 2-approximation algorithm for the directed multiway cut problem
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- A recursive algorithm for constrained two-dimensional cutting problems
- An algorithm for the solution of the two-route Johnson problem
- A simple algorithm for the multiway cut problem
- Algorithms for Multiterminal Cuts
Cited in
(10)- Region growing for multi-route cuts
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Approximate duality of multicommodity multiroute flows and cuts: single source case
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Improved region-growing and combinatorial algorithms for k-route cut problems (extended abstract)
- An algorithm for the solution of the two-route Johnson problem
- A cutting plane algorithm for the general routing problem
- Cuts and Disjoint Paths in the Valley-Free Path Model
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
- Flows, cuts and integral routing in graphs -- an approximation algorithmist's perspective
This page was built for publication: Algorithms for 2-Route Cut Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521941)
