Compact oblivious routing

DOI10.4230/LIPICS.ESA.2019.75MaRDI QIDQ5075823zbMATH OpenFDO

Authors Harald Räcke, Stefan Schmid

Publication date 11 May 2022

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

zbMATH Keywords

compact routingcompetitive analysisoblivious routing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Compact oblivious routing in weighted graphs
• Survey on oblivious routing strategies
• Oblivious routing in directed graphs with random demands
• Oblivious routing on node-capacitated and directed graphs
• Oblivious routing on node-capacitated and directed graphs

Cites work

• A general approach to online network optimization problems
• A Unified Approach to Approximating Partial Covering Problems
• Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
• Compact policy routing
• Compact routing with minimum stretch
• Computing cut-based hierarchical decompositions in almost linear time
• Cut Problems in Graphs with a Budget Constraint
• Designing networks with compact routing tables
• 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?)
• scientific article; zbMATH DE number 2119660 (Why is no real title available?)
• Memory requirement for routing in distributed networks
• Memory requirement for universal routing schemes
• Min-max Graph Partitioning and Small Set Expansion
• On the advantage of overlapping clusters for minimizing conductance
• On-line routing in all-optical networks
• Optimal oblivious routing in polynomial time
• Routing, merging, and sorting on parallel models of computation
• Simultaneous source location
• Survey on oblivious routing strategies
• The all-or-nothing multicommodity flow problem
• Tight bounds for oblivious routing in the hypercube

Cited in

(6)

• Oblivious routing with limited buffer capacity
• Compact routing with slack
• Compact oblivious routing in weighted graphs
• Optimal oblivious routing in polynomial time
• Bounds on oblivious multiparty quantum communication complexity
• Sparse Semi-Oblivious Routing: Few Random Paths Suffice

This page was built for publication: Compact oblivious routing

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