Linear time algorithms for the ring loading problem with demand splitting

DOI10.1016/j.jalgor.2004.03.003zbMath1090.68011OpenAlexW2026002305MaRDI QIDQ4651810

Biing-Feng Wang

Publication date: 22 February 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.03.003

zbMATH Keywords

AlgorithmsRoutingRingsOptical networksDisjoint-set data structures

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

The weighted link ring loading problem ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Online mixed ring covering problem with two nodes ⋮ Computing minimal solutions to the ring loading problem ⋮ Routing equal-size messages on a slotted ring ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Stability vs. optimality in selfish ring routing ⋮ Integral polyhedra related to integer multicommodity flows on a cycle ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Multicommodity flows in cycle graphs ⋮ Optimal online ring routing ⋮ A compact formulation of the ring loading problem with integer demand splitting ⋮ Multicuts and integral multiflows in rings ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games ⋮ Approximation algorithms for the ring loading problem with penalty cost

This page was built for publication: Linear time algorithms for the ring loading problem with demand splitting