IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v18y2009i3d10.1007_s10878-009-9227-8.html
   My bibliography  Save this article

A 6.55 factor primal-dual approximation algorithm for the connected facility location problem

Author

Listed:
  • Hyunwoo Jung

    (Korea Advanced Institute of Science and Technology)

  • Mohammad Khairul Hasan

    (Korea Advanced Institute of Science and Technology)

  • Kyung-Yong Chwa

    (Korea Advanced Institute of Science and Technology)

Abstract

In the connected facility location (ConFL) problem, we are given a graph G=(V,E) with nonnegative edge cost c e on the edges, a set of facilities ℱ⊆V, a set of demands (i.e., clients) $\mathcal{D}\subseteq V$ , and a parameter M≥1. Each facility i has a nonnegative opening cost f i and each client j has d j units of demand. Our objective is to open some facilities, say F⊆ℱ, assign each demand j to some open facility i(j)∈F and connect all open facilities using a Steiner tree T such that the total cost, which is $\sum_{i\in F}f_{i}+\sum_{j\in \mathcal{D}}d_{j}c_{i(j)j}+M\sum_{e\in T}c_{e}$ , is minimized. We present a primal-dual 6.55-approximation algorithm for the ConFL problem which improves the previous primal-dual 8.55-approximation algorithm given by Swamy and Kumar (Algorithmica 40:245–269, 2004).

Suggested Citation

  • Hyunwoo Jung & Mohammad Khairul Hasan & Kyung-Yong Chwa, 2009. "A 6.55 factor primal-dual approximation algorithm for the connected facility location problem," Journal of Combinatorial Optimization, Springer, vol. 18(3), pages 258-271, October.
    • Handle: RePEc:spr:jcomop:v:18:y:2009:i:3:d:10.1007_s10878-009-9227-8
    DOI: 10.1007/s10878-009-9227-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9227-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-009-9227-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mohammad Khairul Hasan & Hyunwoo Jung & Kyung-Yong Chwa, 2008. "Approximation algorithms for connected facility location problems," Journal of Combinatorial Optimization, Springer, vol. 16(2), pages 155-172, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fengmin Wang & Dachuan Xu & Chenchen Wu, 2016. "Combinatorial approximation algorithms for the robust facility location problem with penalties," Journal of Global Optimization, Springer, vol. 64(3), pages 483-496, March.
    2. Li, Xiaopeng & Medal, Hugh & Qu, Xiaobo, 2019. "Connected infrastructure location design under additive service utilities," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 99-124.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.
    2. Li, Xiaopeng & Medal, Hugh & Qu, Xiaobo, 2019. "Connected infrastructure location design under additive service utilities," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 99-124.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:18:y:2009:i:3:d:10.1007_s10878-009-9227-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.