Greedy distributed optimization of multi-commodity flows
From MaRDI portal
Publication:2377262
DOI10.1007/s00446-008-0074-0zbMath1267.68307OpenAlexW2102523721MaRDI QIDQ2377262
Rohit Khandekar, Baruch Awerbuch
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-008-0074-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Fast approximation algorithms for multicommodity flow problems
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- How bad is selfish routing?
- Self-stabilizing systems in spite of distributed control
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Adaptive routing with stale information
- A parallel approximation algorithm for positive linear programming
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Distributed network monitoring and multicommodity flows
- Approximation and Online Algorithms
- The Price of Routing Unsplittable Flow
This page was built for publication: Greedy distributed optimization of multi-commodity flows
