An approximation algorithm for k-median with priorities  

作　　者：Zhen ZHANG Qilong FENG Jinhui XU Jianxin WANG 

机构地区：[1]School of Computer Science and Engineering,Central South University,Changsha 410083,China [2]Department of Computer Science and Engineering,State University of New York at Buffalo,Buffalo 14200,USA

出　　处：《Science China(Information Sciences)》2021年第5期41-42,共2页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.61872450,61672536,61828205,61802441,71631008);Hunan Provincial Key Lab on Bioinformatics,and Hunan Provincial Science and Technology Program(Grant No.2018WK4001)。

摘　　要：Dear editor,Clustering is a fundamental problem in computer science.This problem is to partition a given set of clients into several clusters such that clients in the same cluster are more similar to each other.In many clustering applications,the clients are different in the levels of services they require.Motivated by such applications,Ravi and Sinha[1]introduced the problem of clustering with priorities,wherein each client is associated with a priority and can only be assigned to a facility opened at the same or higher priorities.

关 键 词：CLIENT EDITOR SERVICES 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]