Obserwuj
Sara Ahmadian
Tytuł
Cytowane przez
Cytowane przez
Rok
Better Guarantees for -Means and Euclidean -Median by Primal-Dual Algorithms
S Ahmadian, A Norouzi-Fard, O Svensson, J Ward
SIAM Journal on Computing 49 (4), FOCS17-97-FOCS17-156, 2019
2872019
Clustering without over-representation
S Ahmadian, A Epasto, R Kumar, M Mahdian
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019
1172019
Fair correlation clustering
S Ahmadian, A Epasto, R Kumar, M Mahdian
International conference on artificial intelligence and statistics, 4195-4205, 2020
672020
Improved approximation guarantees for lower-bounded facility location
S Ahmadian, C Swamy
International Workshop on Approximation and Online Algorithms, 257-271, 2012
552012
Approximation algorithms for clustering problems with lower bounds and outliers
S Ahmadian, C Swamy
arXiv preprint arXiv:1608.01700, 2016
522016
Fair hierarchical clustering
S Ahmadian, A Epasto, M Knittel, R Kumar, M Mahdian, B Moseley, ...
Advances in Neural Information Processing Systems 33, 21050-21060, 2020
482020
Local-Search based Approximation Algorithms for Mobile Facility Location Problems
S Ahmadian, Z Friggstad, C Swamy
ACM-SIAM Symposium on Discrete Algorithms, 2013
442013
Bisect and conquer: Hierarchical clustering via max-uncut bisection
S Ahmadian, V Chatziafratis, A Epasto, E Lee, M Mahdian, K Makarychev, ...
arXiv preprint arXiv:1912.06983, 2019
182019
Stabilizing network bargaining games by blocking players
S Ahmadian, H Hosseinzadeh, L Sanità
Mathematical Programming 172 (1), 249-275, 2018
152018
Bisect and conquer: Hierarchical clustering via max-uncut bisection
V Chatziafratis, G Yaroslavtsev, E Lee, K Makarychev, S Ahmadian, ...
International Conference on Artificial Intelligence and Statistics, 3121-3132, 2020
122020
Algorithms for inverse optimization problems
S Ahmadian, U Bhaskar, L Sanità, C Swamy
26th Annual European Symposium on Algorithms (ESA 2018), 2018
112018
Maximizing agreements for ranking, clustering and hierarchical clustering via max-cut
V Chatziafratis, M Mahdian, S Ahmadian
International Conference on Artificial Intelligence and Statistics, 1657-1665, 2021
92021
Robust load balancing with machine learned advice
S Ahmadian, H Esfandiari, V Mirrokni, B Peng
Journal of Machine Learning Research 24 (44), 1-46, 2023
82023
Improved approximation for fair correlation clustering
S Ahmadian, M Negahbani
International Conference on Artificial Intelligence and Statistics, 9499-9516, 2023
72023
Kwikbucks: Correlation clustering with cheap-weak and expensive-strong signals
S Silwal, S Ahmadian, A Nystrom, A McCallum, D Ramachandran, ...
The Eleventh International Conference on Learning Representations, 2022
62022
Approximation Algorithms for Minimum-Load k-Facility Location
S Ahmadian, B Behsaz, Z Friggstad, A Jorati, MR Salavatipour, C Swamy
ACM Transactions on Algorithms (TALG) 14 (2), 1-29, 2018
42018
Distributed load balancing: A new framework and improved guarantees
S Ahmadian, A Liu, B Peng, M Zadimoghaddam
12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
32021
A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications
S Ahmadian, S Haddadan
2020 IEEE International Conference on Big Data (Big Data), 5-14, 2020
32020
Further approximations for demand matching: Matroid constraints and minor-closed graphs
S Ahmadian, Z Friggstad
arXiv preprint arXiv:1705.10396, 2017
32017
Approximation algorithms for clustering and facility location problems
S Ahmadian
University of Waterloo, 2017
32017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20