An improved FPT approximation algorithm for diversity-aware l-centrum

DOI10.1016/J.JCSS.2026.103845MaRDI QIDQ7404696zbMATH OpenFDO

Authors Junteng Song, Shuilian Liu, Yicheng Xu, Yong Zhang

Publication date 2027

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2026.103845

zbMATH Keywords

\(l\)-centrumdiversity-aware clusteringfair clusteringfixed parameter tractabilitysubmodular optimization

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A fixed-parameter tractable approximation for capacitated k-supplier
• A unified framework for approximating and clustering data
• An approximation algorithm for diversity-aware fair \(k\)-supplier problem
• Approximation algorithms for minimum norm and ordered optimization problems
• scientific article; zbMATH DE number 7561535 (Why is no real title available?)
• Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
• Locating tree-shaped facilities using the ordered median objective
• Maximizing a monotone submodular function subject to a matroid constraint
• Ordered k-Median with outliers
• The k-centrum multi-facility location problem
• The ordered \(k\)-median problem: surrogate models and approximation algorithms

This page was built for publication: An improved FPT approximation algorithm for diversity-aware \(l\)-centrum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404696)