Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)

DOI10.1007/978-3-540-72951-8_1MaRDI QIDQ5425955zbMATH OpenOpenAlexFDO

Authors Alessandro Panconesi

Publication date 15 November 2007

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72951-8_1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Distributed algorithms (68W15)

Recommendations

• Fast primal-dual distributed algorithms for scheduling and matching problems
• Some simple distributed algorithms for sparse networks
• Return of the primal-dual, distributed metric facility location
• Fully Distributed Algorithms for Convex Optimization Problems
• Combinatorial algorithms for distributed graph coloring

Cited in

(9)

• Distributed Primal Decomposition for Large-Scale MILPs
• A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
• Fast distributed algorithms for LP-type problems of low dimension
• Rapid randomized pruning for fast greedy distributed algorithms
• Fast Distributed Approximations in Planar Graphs
• Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
• A class of randomized primal-dual algorithms for distributed optimization
• A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problems
• Minimizing the total cost of network measurements in a distributed manner, a primal-dual approach

This page was built for publication: Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)

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