In this paper, we present an approximation algorithm achieving approximation guarantee of 2 for the classical uncapacitated facility location problem. The distinguishing feature of our designed algorithm is the overall low running time of , where , and are the number of cities and facilities. Though the approximation factor is 1.61 in Ref.[1], whereas the running time is , where . Compared with the approximation algorithm in Ref.[1], the advantage of our algorithm is it has more applications with lower running time