Improved bi-point rounding algorithms and a golden barrier for k-median

DOI10.1137/1.9781611977554.CH38MaRDI QIDQ6538567zbMATH OpenFDO

Authors Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH38

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(11)

• FPT approximation for capacitated clustering with outliers
• An o( n)-approximation for submodular facility location
• Improved approximation algorithm for individual fairness k-median
• Clustering under a knapsack constraint: parameterized approximation for the knapsack median problem
• Polynomial-time approximation schemes for facility location on planar graphs
• Improved approximation algorithm for capacitated facility location with uniform facility cost
• Separating \(k\)-\textsc{Median} from the supplier version
• Better guarantees for individual fairness k-median
• The seeding and bi-criteria algorithms for fuzzy k-median problem
• When far is better: the Chamberlin-Courant approach to obnoxious committee selection
• Parameterized approximation schemes for fair-range clustering

This page was built for publication: Improved bi-point rounding algorithms and a golden barrier for \(k\)-median

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