Approximate duality of multicommodity multiroute flows and cuts: single source case
From MaRDI portal
Recommendations
- Single source multiroute flows and cuts on uniform capacity networks
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
- Single source multiroute flows and cuts on uniform capacity networks
- Algorithms for 2-Route Cut Problems
Cites work
- A Simple Greedy Algorithm for the k-Disjoint Flow Problem
- Algorithms for 2-Route Cut Problems
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Constructing disjoint paths for secure communication
- scientific article; zbMATH DE number 961880 (Why is no real title available?)
- Maximal Flow Through a Network
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On multiroute maximum flows in networks.
- Region growing for multi-route cuts
- Single source multiroute flows and cuts on uniform capacity networks
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
Cited in
(8)- Single source multiroute flows and cuts on uniform capacity networks
- Single-Sink Multicommodity Flow with Side Constraints
- Single source multiroute flows and cuts on uniform capacity networks
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Approximation algorithms and hardness of the \(k\)-route cut problem
- On the Max-flow min-cut ratio for directed multicommodity flows
This page was built for publication: Approximate duality of multicommodity multiroute flows and cuts: single source case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743437)
