Document Open Access Logo

Bicriteria Approximation Algorithms for Priority Matroid Median

Authors Tanvi Bajpai, Chandra Chekuri

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2023.7.pdf
  • Filesize: 0.93 MB
  • 22 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Facility location and clustering
Keywords
  • k-median
  • fair clustering
  • matroid

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Fairness considerations have motivated new clustering problems and algorithms in recent years. In this paper we consider the Priority Matroid Median problem which generalizes the Priority k-Median problem that has recently been studied. The input consists of a set of facilities ℱ and a set of clients 𝒞 that lie in a metric space (ℱ ∪ 𝒞,d), and a matroid ℳ = (ℱ,ℐ) over the facilities. In addition, each client j has a specified radius r_j ≥ 0 and each facility i ∈ ℱ has an opening cost f_i > 0. The goal is to choose a subset S ⊆ ℱ of facilities to minimize ∑_{i ∈ ℱ} f_i + ∑_{j ∈ 𝒞} d(j,S) subject to two constraints: (i) S is an independent set in ℳ (that is S ∈ ℐ) and (ii) for each client j, its distance to an open facility is at most r_j (that is, d(j,S) ≤ r_j). For this problem we describe the first bicriteria (c₁,c₂) approximations for fixed constants c₁,c₂: the radius constraints of the clients are violated by at most a factor of c₁ and the objective cost is at most c₂ times the optimum cost. We also improve the previously known bicriteria approximation for the uniform radius setting (r_j : = L ∀ j ∈ 𝒞).

Cite As Get BibTex

Tanvi Bajpai and Chandra Chekuri. Bicriteria Approximation Algorithms for Priority Matroid Median. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 7:1-7:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.7

Author Details

Tanvi Bajpai
  • Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA
Chandra Chekuri
  • Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA

Funding

  • Bajpai, Tanvi: Supported in part by NSF grant CCF-1910149.
  • Chekuri, Chandra: Supported in part by NSF grants CCF-1910149 and CCF-1907937.

References

  1. Mohsen Abbasi, Aditya Bhaskara, and Suresh Venkatasubramanian. Fair clustering via equitable group representations. In Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pages 504-514, 2021. Google Scholar
  2. Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward. Better guarantees for k-means and euclidean k-median by primal-dual algorithms. SIAM Journal on Computing, 49(4):FOCS17-97-FOCS17-156, 2020. URL: https://doi.org/10.1137/18M1171321.
  3. Soroush Alamdari and David B. Shmoys. A bicriteria approximation algorithm for the k-center and k-median problems. In WAOA, 2017. Google Scholar
  4. Ali Aouad and Danny Segev. The ordered k-median problem: surrogate models and approximation algorithms. Mathematical Programming, 177(1):55-83, 2019. Google Scholar
  5. David Arthur and Sergei Vassilvitskii. K-means++: The advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pages 1027-1035, USA, 2007. Society for Industrial and Applied Mathematics. Google Scholar
  6. Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, and Maryam Negahbani. Revisiting priority k-center: Fairness and outliers. arXiv preprint, 2021. URL: https://arxiv.org/abs/2103.03337.
  7. Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Kasturi Varadarajan. A Constant Approximation for Colorful k-Center. In Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms (ESA 2019), volume 144 of Leibniz International Proceedings in Informatics (LIPIcs), pages 12:1-12:14, Dagstuhl, Germany, 2019. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.ESA.2019.12.
  8. Jarosław Byrka, Krzysztof Sornat, and Joachim Spoerhase. Constant-factor approximation for ordered k-median. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pages 620-631, New York, NY, USA, 2018. Association for Computing Machinery. URL: https://doi.org/10.1145/3188745.3188930.
  9. Deeparnab Chakrabarty and Maryam Negahbani. Better algorithms for individually fair k-clustering, 2021. URL: https://arxiv.org/abs/2106.12150.
  10. Moses Charikar, Sudipto Guha, Éva Tardos, and David B. Shmoys. A constant-factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences, 65(1):129-149, 2002. URL: https://doi.org/10.1006/jcss.2002.1882.
  11. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. Fair clustering through fairlets. Advances in Neural Information Processing Systems, 30, 2017. Google Scholar
  12. Jack Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial Optimization—Eureka, You Shrink!, pages 11-26. Springer, 2003. Google Scholar
  13. Mehrdad Ghadiri, Samira Samadi, and Santosh Vempala. Socially fair k-means clustering. In Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, FAccT '21, pages 438-448, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3442188.3445906.
  14. MohammadTaghi Hajiaghayi, Rohit Khandekar, and Guy Kortsarz. Budgeted red-blue median and its generalizations. In European Symposium on Algorithms, pages 314-325. Springer, 2010. Google Scholar
  15. Dorit S. Hochbaum and David B. Shmoys. A best possible heuristic for the k-center problem. Math. Oper. Res., 10(2):180-184, May 1985. URL: https://doi.org/10.1287/moor.10.2.180.
  16. Kamal Jain and Vijay V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM, 48(2):274-296, March 2001. URL: https://doi.org/10.1145/375827.375845.
  17. Christopher Jung, Sampath Kannan, and Neil Lutz. A center in your neighborhood: Fairness in facility location. arXiv preprint, 2019. URL: https://arxiv.org/abs/1908.09041.
  18. Naoyuki Kamiyama. The distance-constrained matroid median problem. Algorithmica, 82(7):2087-2106, July 2020. URL: https://doi.org/10.1007/s00453-020-00688-5.
  19. T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu. An efficient k-means clustering algorithm: analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7):881-892, 2002. URL: https://doi.org/10.1109/TPAMI.2002.1017616.
  20. Matthäus Kleindessner, Pranjal Awasthi, and Jamie Morgenstern. Fair k-center clustering for data summarization. In International Conference on Machine Learning, pages 3448-3457. PMLR, 2019. Google Scholar
  21. Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, and Barna Saha. The matroid median problem. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 1117-1130, USA, 2011. Society for Industrial and Applied Mathematics. Google Scholar
  22. Ravishankar Krishnaswamy, Shi Li, and Sai Sandeep. Constant approximation for k-median and k-means with outliers via iterative rounding. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 646-659, 2018. Google Scholar
  23. Sepideh Mahabadi and Ali Vakilian. Individual fairness for k-clustering, 2020. URL: https://arxiv.org/abs/2002.06742.
  24. Stefan Nickel and Justo Puerto. Location theory: a unified approach. Springer Science & Business Media, 2006. Google Scholar
  25. J. Plesník. A heuristic for the p-center problems in graphs. Discrete Applied Mathematics, 17(3):263-268, 1987. URL: https://doi.org/10.1016/0166-218X(87)90029-1.
  26. Alexander Schrijver et al. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer, 2003. Google Scholar
  27. Chaitanya Swamy. Improved approximation algorithms for matroid and knapsack median problems and applications. ACM Trans. Algorithms, 12(4), August 2016. URL: https://doi.org/10.1145/2963170.
  28. Ali Vakilian and Mustafa Yalçıner. Improved approximation algorithms for individually fair clustering, 2021. URL: https://doi.org/10.48550/arXiv.2106.14043.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact