Greedy distributed optimization of multi-commodity flows
From MaRDI portal
Publication:2377262
DOI10.1007/S00446-008-0074-0zbMATH Open1267.68307OpenAlexW2102523721MaRDI QIDQ2377262FDOQ2377262
Authors: Baruch Awerbuch, Rohit Khandekar 
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
Recommendations
- Greedy distributed optimization of multi-commodity flows
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Stateless distributed algorithms for near optimal maximum multicommodity flows
- Distributed network monitoring and multicommodity flows, a primal-dual approach
Cites Work
- Worst-case equilibria
- How bad is selfish routing?
- Self-stabilizing systems in spite of distributed control
- Fast convergence of selfish rerouting
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- The price of routing unsplittable flow
- Convergence to approximate Nash equilibria in congestion games
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Adaptive routing with stale information
- A parallel approximation algorithm for positive linear programming
- Approximation and Online Algorithms
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast approximation algorithms for multicommodity flow problems
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Distributed network monitoring and multicommodity flows, a primal-dual approach
Cited In (11)
- A maximum multicommodity flow problem with global fair met rate
- The Multi-Commodity Source Location Problems and the Price of Greed
- Flow and greedy algorithms of resource co-allocation in distributed systems
- Greedy distributed optimization of multi-commodity flows
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
- Stateless distributed algorithms for near optimal maximum multicommodity flows
- Distributed network monitoring and multicommodity flows, a primal-dual approach
- Title not available (Why is that?)
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
This page was built for publication: Greedy distributed optimization of multi-commodity flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377262)
