K-center and K-median problems in graded distances
文献类型：期刊论文
| 作者 | Lin, GH; Xue, GL |
| 刊名 | THEORETICAL COMPUTER SCIENCE
 |
| 出版日期 | 1998-10-28 |
| 卷号 | 207期号:1页码:181-192 |
| 关键词 | the k-center problem the k-median problem graded distance matrix computational complexity |
| ISSN号 | 0304-3975 |
| 英文摘要 | 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. |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000076053700013 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/13355]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。