A parameterized approximation algorithm for the diversity-aware l-centrum problem

DOI10.1007/978-981-95-4839-2_27MaRDI QIDQ7290095zbMATH OpenFDO

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

Publication date 6 July 2026

Full work available at URL https://doi.org/10.1007/978-981-95-4839-2_27

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A unified framework for approximating and clustering data
• Approximation algorithms for minimum norm and ordered optimization problems
• FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii
• scientific article; zbMATH DE number 7561535 (Why is no real title available?)
• scientific article; zbMATH DE number 7651201 (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
• On the fixed-parameter tractability of capacitated clustering
• 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: A parameterized approximation algorithm for the diversity-aware \(l\)-centrum problem

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