Distributed network monitoring and multicommodity flows
Baruch Awerbuch, Rohit Khandekar · 2007
A canonical distributed optimization problem is solving a Covering/Packing Linear Program in a distributed environment with fast convergence and low communication and space overheads. In this paper, we consider the following covering and packing problems, which are the dual of each other: