Spectral Relaxations and Fair Densest Subgraphs-Reference-Cited by-同舟云学术

Spectral Relaxations and Fair Densest Subgraphs

Published:2020-10-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM International Conference on Information & Knowledge Management
language:
Short-container-title:

Author:

Anagnostopoulos Aris¹,Becchetti Luca¹,Fazzone Adriano¹,Menghini Cristina¹,Schwiegelshohn Chris¹

Affiliation:

1. Sapienza University of Rome, Rome, Italy

Funder

EC H2020RIA project

MIUR PRIN project ALGADIMAR

ERC Advanced Grant 788893 AMDROMA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3340531.3412036

Reference48 articles.

1. Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma

2. Bercea I. O. Groß M. Khuller S. Kumar A. Rö sner C. Schmidt D. R. and Schmidt M. On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018). Bercea I. O. Groß M. Khuller S. Kumar A. Rö sner C. Schmidt D. R. and Schmidt M. On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018).

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fair Column Subset Selection;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery;Proceedings of the ACM on Management of Data;2024-05-29

4. Fair Projections as a Means Towards Balanced Recommendations;ACM Transactions on Intelligent Systems and Technology;2024-05-14

5. Finding Densest Subgraphs with Edge-Color Constraints;Proceedings of the ACM Web Conference 2024;2024-05-13