scientific article; zbMATH DE number 7525512
From MaRDI portal
Publication:5075823
DOI10.4230/LIPICS.ESA.2019.75MaRDI QIDQ5075823FDOQ5075823
Authors: Harald Räcke, Stefan Schmid 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1812.09887
Title of this publication is not available (Why is that?)
Cites Work
- Routing, merging, and sorting on parallel models of computation
- Designing networks with compact routing tables
- Title not available (Why is that?)
- Min-max Graph Partitioning and Small Set Expansion
- Compact routing with minimum stretch
- Cut Problems in Graphs with a Budget Constraint
- Simultaneous source location
- A general approach to online network optimization problems
- Title not available (Why is that?)
- The all-or-nothing multicommodity flow problem
- Memory requirement for routing in distributed networks
- Title not available (Why is that?)
- On the advantage of overlapping clusters for minimizing conductance
- A Unified Approach to Approximating Partial Covering Problems
- Tight bounds for oblivious routing in the hypercube
- Memory requirement for universal routing schemes
- On-line routing in all-optical networks
- Survey on oblivious routing strategies
- Optimal oblivious routing in polynomial time
- Graph partitioning using single commodity flows
- Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
- Approximate Undirected Maximum Flows in O(mpolylog(n)) Time
- Compact policy routing
Cited In (6)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075823)
