Max-Min Dispersion on a Line

被引:3
|
作者
Araki, Tetsuya [1 ]
Nakano, Shin-ichi [2 ]
机构
[1] Tokyo Metropolitan Univ, Hachioji, Tokyo, Japan
[2] Gunma Univ, Kiryu, Gumma, Japan
关键词
Dispersion problem; Algorithm;
D O I
10.1007/978-3-030-04651-4_45
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Given a set P of n locations on which facilities can be placed and an integer k, we want to place k facilities on some locations so that a designated objective function is maximized. The problem is called the k-dispersion problem. In this paper we give a simple O(n) time algorithm to solve the maxmin version of the k-dispersion problem if P is a set of points on a line. This is the first O(n) time algorithm to solve the max-min k-dispersion problem for the set of "unsorted" points on a line. If P is a set of sorted points on a line, and the input is given as an array in which the coordinates of the points are stored in the sorted order, then by slightly modifying the algorithm above one can solve the dispersion problem in O(log n) time. This is the first sublinear time algorithm to solve the max-min k-dispersion problem for the set of sorted points on a line.
引用
收藏
页码:672 / 678
页数:7
相关论文
共 50 条
  • [31] Local Approximability of Max-Min and Min-Max Linear Programs
    Patrik Floréen
    Marja Hassinen
    Joel Kaasinen
    Petteri Kaski
    Topi Musto
    Jukka Suomela
    Theory of Computing Systems, 2011, 49 : 672 - 697
  • [32] Gumbel central limit theorem for max-min and min-max
    Eliazar, Iddo
    Metzler, Ralf
    Reuveni, Shlomi
    PHYSICAL REVIEW E, 2019, 100 (02)
  • [33] A unified framework for max-min and min-max fairness with applications
    Radunovic, Bozidar
    Le Boudec, Jean-Yves
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (05) : 1073 - 1083
  • [34] A max-min ant system algorithm with εMAX selection
    Ogawa, Masato
    Li, Lei
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2008, 11 (04): : 467 - 471
  • [35] Online Max-min Fair Allocation
    Kawase, Yasushi
    Sumita, Hanna
    ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 526 - 543
  • [36] SOME RESULTS ON MAX-MIN PURSUIT
    FLYNN, J
    SIAM JOURNAL ON CONTROL, 1974, 12 (01): : 53 - 69
  • [37] Max-min fair survivable networks
    Bashllari, A.
    Nace, D.
    Gourdin, E.
    Klopfenstein, O.
    ANNALS OF TELECOMMUNICATIONS, 2008, 63 (9-10) : 511 - 522
  • [38] Convergence of max-min consensus algorithms
    Shi, Guodong
    Xia, Weiguo
    Johansson, Karl Henrik
    AUTOMATICA, 2015, 62 : 11 - 17
  • [39] Hankel max-min matrices and their applications
    Tomaskova, Hana
    Gavalec, Martin
    PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 909 - 914
  • [40] EIGENSPACE OF A CIRCULANT MAX-MIN MATRIX
    Gavalec, Martin
    Tomaskova, Hana
    KYBERNETIKA, 2010, 46 (03) : 397 - 404