An Improved Upper Bound for the Ring Loading Problem
From MaRDI portal
Publication:5071092
DOI10.1137/20M1319395zbMath1487.90207MaRDI QIDQ5071092
Publication date: 20 April 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- The weighted link ring loading problem
- A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
- Edge-disjoint paths in planar graphs
- On the single-source unsplittable flow problem
- A polynomial time approximation algorithm for dynamic storage allocation
- Balancing loads on Sonet rings with integer demand splitting
- On the ring loading problem with demand splitting.
- Approximating the single source unsplittable min-cost flow problem
- Exact solution of the SONET ring loading problem
- An improved upper bound for the Ring Loading Problem
- An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
- A Note on the Ring Loading Problem
- Single-Sink Multicommodity Flow with Side Constraints
- Convex Combinations of Single Source Unsplittable Flows
- The Linearity of First-Fit Coloring of Interval Graphs
- Optimal Load Balancing on Sonet Bidirectional Rings
- The Ring Loading Problem
- Approximation algorithms for dynamic storage allocation
- OPTVersusLOADin Dynamic Storage Allocation
- Linear time algorithms for the ring loading problem with demand splitting
- Multicommodity Flows in Ring Networks
This page was built for publication: An Improved Upper Bound for the Ring Loading Problem
