A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

DOI10.1016/J.TCS.2010.04.035zbMath1192.68834OpenAlexW2089110625MaRDI QIDQ982669

J. Martínez

Publication date: 7 July 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.035

zbMATH Keywords

polynomial-time algorithmring loading problemweighted load

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (3)

An Improved Upper Bound for the Ring Loading Problem ⋮ A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring ⋮ Online mixed ring covering problem with two nodes

Uses Software

• SONET

Cites Work

• The weighted link ring loading problem
• Multicommodity flows in planar graphs
• Algorithms for routing around a rectangle
• On the ring loading problem with demand splitting.
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• Exact solution of the SONET ring loading problem
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• Edge-disjoint routing in plane switch graphs in linear time
• Optimal Load Balancing on Sonet Bidirectional Rings
• The Ring Loading Problem
• Linear time algorithms for the ring loading problem with demand splitting

This page was built for publication: A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting