Distributed algorithms for multicommodity flow problems via approximate steepest descent framework

zbMATH Open1302.68309MaRDI QIDQ2934686FDOQ2934686

Authors: Baruch Awerbuch, Rohit Khandekar, Satish Rao 

Publication date: 18 December 2014

Recommendations

• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Greedy distributed optimization of multi-commodity flows
• Greedy distributed optimization of multi-commodity flows
• Stateless distributed algorithms for near optimal maximum multicommodity flows
• Fast approximation algorithms for multicommodity flow problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Cited In (13)

• Efficient primal-dual graph algorithms for MapReduce
• Greedy distributed optimization of multi-commodity flows
• Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
• Stateless distributed algorithms for near optimal maximum multicommodity flows
• Load balancing without regret in the bulletin board model
• Distributed network monitoring and multicommodity flows, a primal-dual approach
• Management of Variable Data Streams in Networks
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• Approximating Wardrop equilibria with finitely many agents
• Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast
• Title not available (Why is that?)
• Greedy distributed optimization of multi-commodity flows
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework

This page was built for publication: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934686)