scientific article; zbMATH DE number 7525512

DOI10.4230/LIPIcs.ESA.2019.75MaRDI QIDQ5075823

Harald Räcke, Stefan Schmid

Publication date: 11 May 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

competitive analysisoblivious routingcompact routing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Bounds on oblivious multiparty quantum communication complexity ⋮ Unnamed Item ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the advantage of overlapping clusters for minimizing conductance
• Routing, merging, and sorting on parallel models of computation
• Designing networks with compact routing tables
• Compact Routing with Minimum Stretch
• Simultaneous source location
• Memory requirement for routing in distributed networks
• A general approach to online network optimization problems
• Tight bounds for oblivious routing in the hypercube
• Cut Problems in Graphs with a Budget Constraint
• Survey on Oblivious Routing Strategies
• The all-or-nothing multicommodity flow problem
• On-line routing in all-optical networks
• Approximate Undirected Maximum Flows in O(mpolylog(n)) Time
• Memory requirement for universal routing schemes
• Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
• A Unified Approach to Approximating Partial Covering Problems
• Min-max Graph Partitioning and Small Set Expansion
• Graph partitioning using single commodity flows
• Optimal oblivious routing in polynomial time
• Compact policy routing

This page was built for publication: