Distributed Approximation Algorithms for Facility Location Problems

Abstract

In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facility location problem is also implemented in a distributed and asynchronous manner within ( ) O n rounds of communication.