An algorithm for node-capacitated ring routing

DOI10.1016/J.ORL.2006.03.015zbMATH Open1180.90033OpenAlexW2072704702MaRDI QIDQ2467482FDOQ2467482

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

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

• Title not available (Why is that?)
• Edge-disjoint paths in planar graphs
• The Ring Loading Problem
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Multicommodity flows in planar graphs
• Node-Capacitated Ring Routing

Cited In (7)

• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
• A node-capacitated Okamura-Seymour theorem
• Multicuts and integral multiflows in rings
• Title not available (Why is that?)
• Network design with a discrete set of traffic matrices
• Algorithms for generalized round robin routing
• 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)