An approximation algorithm for diversity-aware fair \(k\)-supplier problem

DOI10.1016/j.tcs.2023.114305OpenAlexW4388626461MaRDI QIDQ6144023

No author found.

Publication date: 5 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114305

zbMATH Keywords

approximation algorithmmaximum matchingfacility locationfair clustering\(k\)-supplier problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• A technique for obtaining true approximations for \(k\)-center with covering constraints
• Fair colorful \(k\)-center clustering
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
• A Best Possible Heuristic for the k-Center Problem
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: An approximation algorithm for diversity-aware fair \(k\)-supplier problem