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 条
  • [1] The center location improvement problem under the Hamming distance
    Zhang, BW
    Zhang, JZ
    He, Y
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (02) : 187 - 198
  • [2] THE COMPLEXITY ANALYSIS OF THE SHORTEST PATH IMPROVEMENT PROBLEM UNDER THE HAMMING DISTANCE
    Zhang, Binwu
    Guan, Xiucui
    Wang, Qin
    He, Chunyuan
    Sackey, Samson Hansen
    PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (04): : 605 - 618
  • [3] The shortest path improvement problems under Hamming distance
    Zhang, Binwu
    Zhang, Jianzhong
    Qi, Liqun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 12 (04) : 351 - 361
  • [4] The shortest path improvement problems under Hamming distance
    Binwu Zhang
    Jianzhong Zhang
    Liqun Qi
    Journal of Combinatorial Optimization, 2006, 12
  • [5] An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance
    Binwu Zhang
    Xiucui Guan
    Panos M. Pardalos
    Chunyuan He
    Journal of Optimization Theory and Applications, 2018, 178 : 538 - 559
  • [6] An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance
    Zhang, Binwu
    Guan, Xiucui
    Pardalos, Panos M.
    He, Chunyuan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2018, 178 (02) : 538 - 559
  • [7] Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance
    Zhang, Bingwu
    Guan, Xiucui
    He, Chunyuan
    Wang, Shuguo
    JOURNAL OF APPLIED MATHEMATICS, 2013,
  • [8] The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
    Kien Trung Nguyen
    Ali Reza Sepasian
    Journal of Combinatorial Optimization, 2016, 32 : 872 - 884
  • [9] The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
    Kien Trung Nguyen
    Sepasian, Ali Reza
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (03) : 872 - 884
  • [10] The communication complexity of the Hamming distance problem
    Huang, Wei
    Shi, Yaoyun
    Zhang, Shengyu
    Zhu, Yufan
    INFORMATION PROCESSING LETTERS, 2006, 99 (04) : 149 - 153
12345