Volume 8 Number 9 ( Sep. 2013)
Home > Archive > 2013 > Volume 8 Number 9 ( Sep. 2013) >
JSW 2013 Vol.8(9): 2360-2366 ISSN: 1796-217X
doi: 10.4304/jsw.8.9.2360-2366

A Fast Algorithm for Facility Location Problem

Wenhao Shu
School of Computer and Information Technology, Beijing Jiaotong University, Beijing, 100044, China

Abstract—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 O(mlogm), where c f m=n ×n , c n and f n are the number of cities and facilities. Though the approximation factor is 1.61 in Ref.[1], whereas the running time is 3 O(n ) , where c f n=n+n . Compared with the approximation algorithm in Ref.[1], the advantage of our algorithm is it has more applications with lower running time.

Index Terms—Facility location problem, approximation algorithm, dual fitting, linear programming.


Cite: Wenhao Shu, "A Fast Algorithm for Facility Location Problem," Journal of Software vol. 8, no. 9, pp. 2360-2366, 2013.

General Information

ISSN: 1796-217X (Online)
Frequency: Monthly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
  • Aug 21, 2019 News!

    Papers published in JSW Vol 14, No 1- Vol 14 No 8 have been indexed by DBLP     [Click]

  • Jun 25, 2019 News!

    Vol.13, No.9 has been indexed by EI (Inspec).   [Click]

  • Aug 01, 2018 News!

    [CFP] 2019 the annual meeting of JSW Editorial Board, ICCSM 2019, will be held in Barcelona, Spain, July 14-16, 2019.   [Click]

  • Jul 10, 2019 News!

    Vol 14, No.8 has been published with online version 4 original aritcles from 2 countries are published in this issue.    [Click]

  • Jul 22, 2019 News!

    Welcome Prof Ferhat Khendek from Canada to join the Editorial board of JSW    [Click]