An algorithm for node-capacitated ring routing

DOI10.1016/J.ORL.2006.03.015MaRDI QIDQ2467482zbMATHOpenAlexFDO

Authors András Frank, Balázs Kotnyek, Zoltán Király

Publication date 21 January 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.03.015

zbMATH Keywords

multicommodity flowFourier-Motzkin elimination

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites work

• scientific article; zbMATH DE number 780786 (Why is no real title available?)
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Edge-disjoint paths in planar graphs
• Multicommodity flows in planar graphs
• Node-Capacitated Ring Routing
• The Ring Loading Problem

Cited in

(6)

• scientific article; zbMATH DE number 484567 (Why is no real title available?)
• Algorithms for generalized round robin routing
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
• Network design with a discrete set of traffic matrices
• Multicuts and integral multiflows in rings
• On the complexity of greedy routing in ring-based peer-to-peer networks

This page was built for publication: An algorithm for node-capacitated ring routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467482)