Competitive Online Multicommodity Routing

DOI10.1007/11970125_19MaRDI QIDQ5443523zbMATH OpenOpenAlexFDO

Authors Tobias Harks, Stefan Heinz, Marc E. Pfetsch

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11970125_19

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Traffic problems in operations research (90B20)

Recommendations

• Competitive online multicommodity routing
• scientific article; zbMATH DE number 1347106
• Nonadaptive Selfish Routing with Online Demands
• Optimal online ring routing
• Online Multi-Commodity Flow with High Demands

Cited in

(5)

• Constraint games for stable and optimal allocation of demands in SDN
• Competitive online multicommodity routing
• Nonadaptive Selfish Routing with Online Demands
• Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements
• Competitive routing over time

This page was built for publication: Competitive Online Multicommodity Routing

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