The center location improvement problem under the hamming distance

Journal of Combinatorial Optimization

Volumn 9, Issue 2, 2005, Pages 187-198

  Zhang, Binwu ^a,b   Zhang, Jianzhong ^c   He, Yong ^a  

^a ZHEJIANG UNIVERSITY   (China)

^b HOHAI UNIVERSITY   (China)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Center location problem; Hamming distance; Inapproximability

Indexed keywords

ALGORITHMS; POLYNOMIALS;

CENTER LOCATION PROBLEM; HAMMING DISTANCE; INAPPROXIMATELY;

PROBLEM SOLVING;

EID: 24144477857     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10878-005-6856-4     Document Type: Article

References (6)

1. O. Herman, D.I. Ingco, and A.R. Odoni, "Improving the location of minmax facility through network modification," Networks, vol. 24, pp. 31-41 (1994).
2. 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).
3. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
4. 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.
5. J. Zhang, X. Yang, and M. Cai, "Reverse center location problems," Lecture Notes in Computer Science 1741, Springer, Berlin, 1999, pp. 279-294.
6. J. Zhang, X. Yang, and M. Cai, "A network improvement problem under different norms," Computational Optimization and Applications, vol. 27, pp. 305-319 (2004).