Oblivious routing on node-capacitated and directed graphs

DOI10.1145/1290672.1290688zbMath1446.68117OpenAlexW2996539125MaRDI QIDQ4962691

Leighton, Tom, Harald Räcke, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1290672.1290688

zbMATH Keywords

communication networksdirected graphsoblivious routingnode-capacitated graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Dynamic vs. oblivious routing in network design ⋮ On the approximability of robust network design

This page was built for publication: Oblivious routing on node-capacitated and directed graphs