Compact oblivious routing in weighted graphs

DOI10.4230/LIPICS.ESA.2020.36MaRDI QIDQ5874505zbMATH OpenFDO

Authors Philipp Czerner, Harald Räcke

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2007.02427

zbMATH Keywords

compact routingcompetitive analysisoblivious routing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Compact oblivious routing
• Compact routing schemes with improved stretch
• Oblivious routing on node-capacitated and directed graphs
• Routing with Improved Communication-Space Trade-Off
• Oblivious routing on node-capacitated and directed graphs

Cites work

• A Scheme for Fast Parallel Communication
• Compact oblivious routing
• Compact policy routing
• Compact routing with minimum stretch
• Computing cut-based hierarchical decompositions in almost linear time
• Designing networks with compact routing tables
• Extremal problems in graph theory
• Graph partitioning using single commodity flows
• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• Memory requirement for routing in distributed networks
• Memory requirement for universal routing schemes
• On-line routing in all-optical networks
• Optimal oblivious routing in polynomial time
• Routing, merging, and sorting on parallel models of computation
• Tight bounds for oblivious routing in the hypercube

Cited in

(3)

• Compact oblivious routing
• Optimal oblivious routing in polynomial time
• Sparse Semi-Oblivious Routing: Few Random Paths Suffice

This page was built for publication: Compact oblivious routing in weighted graphs

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