Pages that link to "Item:Q2817640"
From MaRDI portal
The following pages link to Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (Q2817640):
Displaying 9 items.
- Authenticated adversarial routing (Q484328) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- On the stability of dynamic diffusion load balancing (Q2479533) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- (Q5743420) (← links)
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow (Q5746246) (← links)
- An efficient approach to optimization of semi‐stable routing in multicommodity flow networks (Q6087135) (← links)