Multicuts and integral multiflows in rings
From MaRDI portal
Publication:1041998
DOI10.1016/J.EJOR.2008.05.006zbMATH Open1176.90483OpenAlexW2017870028MaRDI QIDQ1041998FDOQ1041998
L. Létocart, Marie-Christine Costa, Cédric Bentz, Frédéric Roupin
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.05.006
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal multicut and maximal integer multiflow: a survey
- Cyclic Scheduling via Integer Programs with Circular Ones
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Improved complexity bounds for location problems on the real line
- Primal-dual approximation algorithms for integral flow and multicut in trees
- The Ring Loading Problem
- Linear time algorithms for the ring loading problem with demand splitting
- A greedy algorithm for multicut and integral multiflow in rooted trees
- Multicommodity Flows in Ring Networks
- An algorithm for node-capacitated ring routing
- Multicommodity flows in cycle graphs
- Algorithms and Data Structures
Cited In (6)
- 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
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Multiterminal flows and cuts
- Network design with a discrete set of traffic matrices
- Stability vs. optimality in selfish ring routing
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)
