An approximation algorithm for k-median with priorities

被引：0

作者：

Zhen ZHANG ^{[1
]}

Qilong FENG ^{[1
]}

Jinhui XU ^{[2
]}

Jianxin WANG ^{[1
]}

机构：

[1] School of Computer Science and Engineering, Central South University

[2] Department of Computer Science and Engineering, State University of New York at Buffalo

来源：

ScienceChina(InformationSciences) | 2021年 / 64卷 / 05期

基金：

中国国家自然科学基金;

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：45 / 46

页数：2

共 50 条

[1] An approximation algorithm for k-median with priorities
Zhang, Zhen
Feng, Qilong
Xu, Jinhui
Wang, Jianxin
SCIENCE CHINA-INFORMATION SCIENCES, 2021, 64 (05)
[2] An approximation algorithm for k-median with priorities
Zhen Zhang
Qilong Feng
Jinhui Xu
Jianxin Wang
Science China Information Sciences, 2021, 64
[3] A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
Zhang, Zhen
Zhang, Jinchuan
Zhu, Lingzhi
IEEE ACCESS, 2021, 9 : 31678 - 31683
[4] A Constant Factor Approximation Algorithm for k-Median Clustering with Outliers
Chen, Ke
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 826 - 835
[5] A constant-factor approximation algorithm for the k-median problem
Charikar, M
Guha, S
Tardos, E
Shmoys, DB
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 65 (01) : 129 - 149
[6] Approximation algorithms for the k-median problem
Solis-Oba, R
EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 292 - 320
[7] An approximation algorithm for lower-bounded k-median with constant factor
Xiaoliang WU
Feng SHI
Yutian GUO
Zhen ZHANG
Junyu HUANG
Jianxin WANG
Science China(Information Sciences), 2022, 65 (04) : 93 - 101
[8] An approximation algorithm for lower-bounded k-median with constant factor
Xiaoliang Wu
Feng Shi
Yutian Guo
Zhen Zhang
Junyu Huang
Jianxin Wang
Science China Information Sciences, 2022, 65
[9] An approximation algorithm for lower-bounded k-median with constant factor
Wu, Xiaoliang
Shi, Feng
Guo, Yutian
Zhang, Zhen
Huang, Junyu
Wang, Jianxin
SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (04)
[10] A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
Hajiaghayi, Mohammadtaghi
Hu, Wei
Li, Jian
Li, Shi
Saha, Barna
ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (03)

← 1 2 3 4 5 →