IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i4d10.1007_s10878-017-0130-4.html
   My bibliography  Save this article

An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs

Author

Listed:
  • Wei Ding

    (Zhejiang University of Water Resources and Electric Power)

  • Ke Qiu

    (Brock University)

Abstract

Given a vertex-weighted undirected connected graph $$G = (V, E, \ell , \rho )$$ G = ( V , E , ℓ , ρ ) , where each edge $$e \in E$$ e ∈ E has a length $$\ell (e) > 0$$ ℓ ( e ) > 0 and each vertex $$v \in V$$ v ∈ V has a weight $$\rho (v) > 0$$ ρ ( v ) > 0 , a subset $$T \subseteq V$$ T ⊆ V of vertices and a set S containing all the points on edges in a subset $$E' \subseteq E$$ E ′ ⊆ E of edges, the generalized absolute 1-center problem (GA1CP), an extension of the classic vertex-weighted absolute 1-center problem (A1CP), asks to find a point from S such that the longest weighted shortest path distance in G from it to T is minimized. This paper presents a simple FPTAS for GA1CP by traversing the edges in $$E'$$ E ′ using a positive real number as step size. The FPTAS takes $$O( |E| |V| + |V|^2 \log \log |V| + \frac{1}{\epsilon } |E'| |T| {\mathcal {R}})$$ O ( | E | | V | + | V | 2 log log | V | + 1 ϵ | E ′ | | T | R ) time, where $${\mathcal {R}}$$ R is an input parameter size of the problem instance, for any given $$\epsilon > 0$$ ϵ > 0 . For instances with a small input parameter size $${\mathcal {R}}$$ R , applying the FPTAS with $$\epsilon = \Theta (1)$$ ϵ = Θ ( 1 ) to the classic vertex-weighted A1CP can produce a $$(1 + \Theta (1))$$ ( 1 + Θ ( 1 ) ) -approximation in at most O(|E| |V|) time when the distance matrix is known and $$O(|E| |V| + |V|^2 \log \log |V|)$$ O ( | E | | V | + | V | 2 log log | V | ) time when the distance matrix is unknown, which are smaller than Kariv and Hakimi’s $$O(|E| |V| \log |V|)$$ O ( | E | | V | log | V | ) -time algorithm and $$O(|E| |V| \log |V| + |V|^3)$$ O ( | E | | V | log | V | + | V | 3 ) -time algorithm, respectively.

Suggested Citation

  • Wei Ding & Ke Qiu, 2017. "An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1084-1095, November.
  • Handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0130-4
    DOI: 10.1007/s10878-017-0130-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0130-4
    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-017-0130-4?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. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    2. Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1983. "State of the Art---Location on Networks: A Survey. Part I: The p-Center and p-Median Problems," Management Science, INFORMS, vol. 29(4), pages 482-497, April.
    3. G. Y. Handler, 1973. "Minimax Location of a Facility in an Undirected Tree Graph," Transportation Science, INFORMS, vol. 7(3), pages 287-293, August.
    4. A. J. Goldman, 1972. "Minimax Location of a Facility in a Network," Transportation Science, INFORMS, vol. 6(4), pages 407-418, November.
    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. Wei Ding & Ke Qiu & Yu Zhou & Zhou Ye, 2022. "A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 905-920, September.
    2. Wei Ding & Ke Qiu, 2020. "Approximating the asymmetric p-center problem in parameterized complete digraphs," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 21-35, July.

    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. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Wei Ding & Ke Qiu & Yu Zhou & Zhou Ye, 2022. "A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 905-920, September.
    3. Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.
    4. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    5. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    6. João António Zeferino, 2020. "Optimizing the location of aerial resources to combat wildfires: a case study of Portugal," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 100(3), pages 1195-1213, February.
    7. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    8. Khachatryan, Hayk & Jessup, Eric & Casavant, Kenneth, 2010. "A GIS-based Estimation of Regional Biomass Supply and Transportation Costs for Biofuel Plant Least-Cost Location Decisions," 51st Annual Transportation Research Forum, Arlington, Virginia, March 11-13, 2010 207816, Transportation Research Forum.
    9. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.
    10. Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.
    11. Widener, Michael J. & Horner, Mark W., 2011. "A hierarchical approach to modeling hurricane disaster relief goods distribution," Journal of Transport Geography, Elsevier, vol. 19(4), pages 821-828.
    12. Xinqiang Qian & Xiucui Guan & Junhua Jia & Qiao Zhang & Panos M. Pardalos, 2023. "Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\infty $$ l ∞ norm," Journal of Global Optimization, Springer, vol. 85(2), pages 461-485, February.
    13. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    14. Jafar Fathali & Mehdi Zaferanieh, 2023. "The balanced 2-median and 2-maxian problems on a tree," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-16, March.
    15. ReVelle, C.S. & Eiselt, H.A. & Daskin, M.S., 2008. "A bibliography for some fundamental problem categories in discrete location science," European Journal of Operational Research, Elsevier, vol. 184(3), pages 817-848, February.
    16. Berman, Oded & Drezner, Zvi & Wesolowsky, George O., 2007. "The transfer point location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 978-989, June.
    17. Rainer E. Burkard & Johannes Hatzl, 2010. "Median problems with positive and negative weights on cycles and cacti," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 27-46, July.
    18. Alfandari, Laurent, 2004. "Choice Rules with Size Constraints for Multiple Criteria Decision Making," ESSEC Working Papers DR 04002, ESSEC Research Center, ESSEC Business School.
    19. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    20. M Horn, 1996. "Analysis and Computational Schemes for p-Median Heuristics," Environment and Planning A, , vol. 28(9), pages 1699-1708, September.

    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:34:y:2017:i:4:d:10.1007_s10878-017-0130-4. 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.