scientific article; zbMATH DE number 961880
From MaRDI portal
Publication:5689762
Recommendations
- On multiroute maximum flows in networks.
- The multiroute maximum flow problem revisited
- Flows over edge-disjoint mixed multipaths and applications
- scientific article; zbMATH DE number 4053314
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
Cited in
(23)- Integer version of the multipath flow network synthesis problem
- Bilevel model for adaptive network flow problem
- Parametric multiroute flow and its application to multilink-attack network
- Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem
- Parametric min-cuts analysis in a network.
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Multi-terminal multipath flows: synthesis
- Flows over edge-disjoint mixed multipaths and applications
- Multiroute flows: cut-trees and realizability
- An improved algorithm for decomposing arc flows into multipath flows
- On multiroute maximum flows in networks.
- Impact of a varying capacity on the all pairs 2-route network flows
- Path Problems in Complex Networks
- Sensitivity analysis on the all pairs q-route flows in a network
- An approximation algorithm for multiroute flow decomposition
- scientific article; zbMATH DE number 1981018 (Why is no real title available?)
- Fractional routing using pairs of failure-disjoint paths
- Congestion minimization for multipath routing via multiroute flows
- The multiroute maximum flow problem revisited
- Short length Menger's theorem and reliable optical routing
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Approximate duality of multicommodity multiroute flows and cuts: single source case
- Robust static and dynamic maximum flows
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 Q5689762)
