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 条
  • [31] Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
    Wang, Hui
    Guan, Xiucui
    Zhang, Qiao
    Zhang, Binwu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (04) : 861 - 887
  • [32] Some inverse optimization problems under the Hamming distance
    Duin, CW
    Volgenant, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 170 (03) : 887 - 899
  • [33] THE ASYMMETRIC DISTANCE LOCATION PROBLEM
    DREZNER, Z
    WESOLOWSKY, GO
    TRANSPORTATION SCIENCE, 1989, 23 (03) : 201 - 207
  • [34] THE SINGLE FACILITY MINIMAX DISTANCE PROBLEM UNDER STOCHASTIC LOCATION OF DEMAND
    CARBONE, R
    MEHREZ, A
    MANAGEMENT SCIENCE, 1980, 26 (01) : 113 - 115
  • [35] The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
    Kien Trung Nguyen
    Chassein, Andre
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (03) : 774 - 781
  • [36] Partial inverse min-max spanning tree problem under the weighted bottleneck hamming distance
    Dong, Qingzhen
    Li, Xianyue
    Yang, Yu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 46 (04)
  • [37] The Closest Pair Problem under the Hamming Metric\]
    Min, Kerui
    Kao, Ming-Yang
    Zhu, Hong
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 205 - +
  • [38] ERDOS-FALCONER DISTANCE PROBLEM UNDER HAMMING METRIC IN VECTOR SPACES OVER FINITE FIELDS
    Xu, Zixiang
    Ge, Gennian
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2208 - 2220
  • [39] Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance
    Karimi, Mobarakeh
    Aman, Massoud
    Dolati, Ardeshir
    TOPICS IN THEORETICAL COMPUTER SCIENCE, TTCS 2017, 2017, 10608 : 34 - 40
  • [40] Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
    Hasanzadeh, Mehran
    Alizadeh, Behrooz
    Baroughi, Fahimeh
    OPTIMIZATION, 2024, 73 (03) : 545 - 574
12345