kMedian近似计算复杂度与局部搜索近似算法分析.pdfVIP

1000-9825/2005/16(03)0392 ©2005 Journal of Software 软 件 学 报 Vol.16, No.3 ∗ k-Median 近似计算复杂度与局部搜索近似算法分析 1+ 1 1 2 潘 锐 , 朱大铭 , 马绍汉 , 肖进杰 1( 山东大学 计算机科学与技术学院, 山东 济南 250061) 2( 山东工商学院 信息与电子工程学院, 山东 烟台 264005) Approximated Computational Hardness and Local Search Approximated Algorithm Analysis for k-Median Problem 1+ 1 1 2 PAN Rui , ZHU Da-Ming , MA Shao-Han , XIAO Jin-Jie 1(School of Computer Science and Technology, Shandong University, Ji’nan 250061, China) 2(School of Information and Electronic Engineering, Shandong Institute of Business and Technology, Yantai 264005, China) + Corresponding author: Phn: +86-531-2730931, E-mail: roypanjn@ 163.com, Received 2003-09-12; Accepted 2004-07-06 Pan R, Zhu DM, Ma SH, Xiao JJ. Approximated computational hardness and local search approximated algorithm analysis for k-median problem. Journal of Software, 2005,16(3):392−399. DOI:10.1360/jos160392 Abstract: Research on the approximated algorithms for k-Median problem has been a focus of computer scientists, and most of the existing results are based on the Euclidean and Metric k-Median problem. However, results for general distance space k-Median has not been found for many years. In general distance space, let dmax ／dmin denote the maximum value of the length of the longest edge divided by the length of the shortest edge for one client point. ω−1 In this paper, it is first proved that ther