The Center Location Improvement Problem Under the Hamming Distance

被引：0
|
作者：
Binwu Zhang
Jianzhong Zhang
Yong He
机构：
[1] Zhejiang University,Department of Mathematics
[2] Hohai University,Department of Mathematics and Physics
[3] City University of Hong Kong,Department of Mathematics
来源：
Journal of Combinatorial Optimization | 2005年 / 9卷
关键词：
center location problem; inapproximability; Hamming distance;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we consider the center location improvement problems under the sum-type and bottleneck-type Hamming distance. For the sum-type problem, we show that achieving an algorithm with a worst-case ratio of O(log |V|) is NP-hard, and for the bottleneck-type problem, we present a strongly polynomial algorithm.
引用
收藏
页码：187 / 198
页数：11
相关论文
共 50 条
  • [41] Donation Center Location Problem
    Chien-Chung Huang
    Zoya Svitkina
    Algorithmica, 2013, 66 : 187 - 210
  • [42] The mixed center location problem
    Xu, Yi
    Peng, Jigen
    Xu, Yinfeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (04) : 1128 - 1144
  • [43] Donation Center Location Problem
    Huang, Chien-Chung
    Svitkina, Zoya
    ALGORITHMICA, 2013, 66 (01) : 187 - 210
  • [44] Reverse center location problem
    Zhang, JZ
    Yang, XG
    Cai, MC
    ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 279 - 294
  • [45] The mixed center location problem
    Yi Xu
    Jigen Peng
    Yinfeng Xu
    Journal of Combinatorial Optimization, 2018, 36 : 1128 - 1144
  • [46] ON THE PROBLEM OF THE DISTANCE TO THE CENTER OF THE GALAXY
    BRANDT, JC
    PUBLICATIONS OF THE ASTRONOMICAL SOCIETY OF THE PACIFIC, 1961, 73 (434) : 324 - 324
  • [47] k-Approximate Quasiperiodicity Under Hamming and Edit Distance
    Aleksander Kędzierski
    Jakub Radoszewski
    Algorithmica, 2022, 84 : 566 - 589
  • [48] Planar maximal covering location problem under block norm distance measure
    Younies, H.
    Wesolowsky, G. O.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (06) : 740 - 750
  • [49] Inverse max sum spanning tree problem under Hamming distance by modifying the sum-cost vector
    Guan, Xiucui
    He, Xinyan
    Pardalos, Panos M.
    Zhang, Binwu
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 69 (04) : 911 - 925
  • [50] An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
    Lei, Yi
    Shao, Hu
    Wu, Ting
    Liu, Pengjie
    OPTIMIZATION LETTERS, 2023, 17 (02) : 453 - 469
12345