Continuous facility location on graphs

被引:0
|
作者
Tim A. Hartmann
Stefan Lendl
Gerhard J. Woeginger
机构
[1] RWTH Aachen,Department of Computer Science
[2] TU Graz,Institute of Discrete Mathematics
来源
Mathematical Programming | 2022年 / 192卷
关键词
Covering; Location theory; Graph theory; Complexity; Parametrized complexity; 90C27; 68Q25; 05C85;
D O I
暂无
中图分类号
学科分类号
摘要
We study a continuous facility location problem on undirected graphs where all edges have unit length and where the facilities may be positioned on the vertices as well as on interior points of the edges. The goal is to cover the entire graph with a minimum number of facilities with covering range δ>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta >0$$\end{document}. In other words, we want to position as few facilities as possible subject to the condition that every point on every edge is at distance at most δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta $$\end{document} from one of these facilities. We investigate this covering problem in terms of the rational parameter δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta $$\end{document}. We prove that the problem is polynomially solvable whenever δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta $$\end{document} is a unit fraction, and that the problem is NP-hard for all non unit fractions δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta $$\end{document}. We also analyze the parametrized complexity with the solution size as parameter: The resulting problem is fixed parameter tractable for δ<3/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta <3/2$$\end{document}, and it is W[2]-hard for δ≥3/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta \ge 3/2$$\end{document}.
引用
收藏
页码:207 / 227
页数:20
相关论文
共 50 条
  • [1] Continuous Facility Location on Graphs
    Hartmann, Tim A.
    Lendl, Stefan
    Woeginger, Gerhard J.
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2020, 2020, 12125 : 171 - 181
  • [2] Continuous facility location on graphs
    Hartmann, Tim A.
    Lendl, Stefan
    Woeginger, Gerhard J.
    [J]. MATHEMATICAL PROGRAMMING, 2022, 192 (1-2) : 207 - 227
  • [3] OBNOXIOUS FACILITY LOCATION ON GRAPHS
    TAMIR, A
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1991, 4 (04) : 550 - 567
  • [4] On a connection between facility location and perfect graphs
    Baiou, Mourad
    Barahona, Francisco
    [J]. OPERATIONS RESEARCH LETTERS, 2014, 42 (6-7) : 466 - 472
  • [5] Securely Connected Facility Location in Metric Graphs
    Martens, Maren
    Bley, Andreas
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 289 - 294
  • [6] Facility Location on Planar Graphs with Unreliable Links
    Narayanaswamy, N. S.
    Nasre, Meghana
    Vijayaragunathan, R.
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018, 2018, 10846 : 269 - 281
  • [7] Quick κ-median, κ-center, and facility location for sparse graphs
    Thorup, M
    [J]. AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 249 - 260
  • [8] Continuous location model of a rectangular barrier facility
    Masashi Miyagawa
    [J]. TOP, 2017, 25 : 95 - 110
  • [9] Continuous location model of a rectangular barrier facility
    Miyagawa, Masashi
    [J]. TOP, 2017, 25 (01) : 95 - 110
  • [10] Continuous Facility Location with Backbone Network Costs
    Carlsson, John Gunnar
    Jia, Fan
    [J]. TRANSPORTATION SCIENCE, 2015, 49 (03) : 433 - 451