Multicuts and integral multiflows in rings
From MaRDI portal
Publication:1041998
Recommendations
Cites work
- scientific article; zbMATH DE number 1303779 (Why is no real title available?)
- A greedy algorithm for multicut and integral multiflow in rooted trees
- An algorithm for node-capacitated ring routing
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Cyclic Scheduling via Integer Programs with Circular Ones
- Improved complexity bounds for location problems on the real line
- Linear time algorithms for the ring loading problem with demand splitting
- Minimal multicut and maximal integer multiflow: a survey
- Multicommodity Flows in Ring Networks
- Multicommodity flows in cycle graphs
- Network flows. Theory, algorithms, and applications.
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Routing and call control algorithms for ring networks.
- The Ring Loading Problem
Cited in
(11)- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Node-Capacitated Ring Routing
- Network design with a discrete set of traffic matrices
- Multiterminal flows and cuts
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
- Stability vs. optimality in selfish ring routing
- A greedy algorithm for multicut and integral multiflow in rooted trees
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity
This page was built for publication: Multicuts and integral multiflows in rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041998)
