Abstract
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.
Similar content being viewed by others
References
O. Berman, D.I. Ingco, and A.R. Odoni, “Improving the location of minmax facility through network modification,” Networks, vol. 24, pp. 31–41 (1994).
Y. He, B. Zhang, and E. Yao, “Weighted inverse minimum spanning tree problems under Hamming distance,” Journal of Combinatorial Optimization, vol. 9, no. 1, pp. 91–100 (2005).
C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
R. Raz and S. Safra, “A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP,” in Proc. 29th Ann. ACM Symp. on Theory of Computing, ACM, 1997, pp. 475–484.
J. Zhang, X. Yang, and M. Cai, “Reverse center location problems,” Lecture Notes in Computer Science 1741, Springer, Berlin, 1999, pp. 279–294.
J. Zhang, X. Yang, and M. Cai, “A network improvement problem under different norms,” Computational Optimization and Applications, vol. 27, pp. 305–319 (2004).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, B., Zhang, J. & He, Y. The Center Location Improvement Problem Under the Hamming Distance. J Comb Optim 9, 187–198 (2005). https://doi.org/10.1007/s10878-005-6856-4
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-6856-4