Approximation algorithms for diversity-bounded center problems

DOI10.1007/978-3-031-20350-3_33MaRDI QIDQ6111979

Yong Zhang, Yicheng Xu, Shuilian Liu, Lu Han

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmparameterized approximationfair clusteringdiversity-bounded center

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• Clustering to minimize the maximum intercluster distance
• A constant-factor approximation algorithm for the \(k\)-median problem
• Fair colorful \(k\)-center clustering
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• Budgeted Red-Blue Median and Its Generalizations
• Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization

This page was built for publication: Approximation algorithms for diversity-bounded center problems