K-center and K-median problems in graded distances

CSpace

	K-center and K-median problems in graded distances
	Lin, GH ; Xue, GL
	1998-10-28
发表期刊	THEORETICAL COMPUTER SCIENCE
ISSN	0304-3975
卷号	207 期号:1 页码:181-192
摘要	Graded distances are generalizations of the Euclidean distance on points in R-1. They have been used in the study of special cases of NP-hard problems. In this paper, we study the k-center and k-median problems with graded distance matrices. We first prove that the k-center problem is polynomial time solvable when the distance matrix is graded up the rows or graded down the rows. We then prove that the k-median problem is NP-complete when the distance matrix is graded up the rows or graded down the rows. An easy special case of the k-median problem with graded distance matrices is also discussed. (C) 1998-Elsevier Science B.V. All rights reserved.
关键词	the k-center problem the k-median problem graded distance matrix computational complexity
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Theory & Methods
WOS记录号	WOS:000076053700013
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13356
专题	中国科学院数学与系统科学研究院
通讯作者	Xue, GL
作者单位	1.Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Lin, GH,Xue, GL. K-center and K-median problems in graded distances[J]. THEORETICAL COMPUTER SCIENCE,1998,207(1):181-192.
APA	Lin, GH,&Xue, GL.(1998).K-center and K-median problems in graded distances.THEORETICAL COMPUTER SCIENCE,207(1),181-192.
MLA	Lin, GH,et al."K-center and K-median problems in graded distances".THEORETICAL COMPUTER SCIENCE 207.1(1998):181-192.