Sara Ahmadian
Zitiert von
Zitiert von
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
Improved approximation guarantees for lower-bounded facility location
S Ahmadian, C Swamy
International Workshop on Approximation and Online Algorithms, 257-271, 2012
Local-Search based Approximation Algorithms for Mobile Facility Location Problems
S Ahmadian, Z Friggstad, C Swamy
ACM-SIAM Symposium on Discrete Algorithms, 2013
Clustering without over-representation
S Ahmadian, A Epasto, R Kumar, M Mahdian
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019
Approximation algorithms for clustering problems with lower bounds and outliers
S Ahmadian, C Swamy
arXiv preprint arXiv:1608.01700, 2016
Stabilizing network bargaining games by blocking players
S Ahmadian, H Hosseinzadeh, L Sanità
Mathematical Programming 172 (1), 249-275, 2018
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
Fair correlation clustering
S Ahmadian, A Epasto, R Kumar, M Mahdian
International Conference on Artificial Intelligence and Statistics, 4195-4205, 2020
Algorithms for inverse optimization problems
S Ahmadian, U Bhaskar, L Sanità, C Swamy
26th Annual European Symposium on Algorithms (ESA 2018), 2018
Fair Hierarchical Clustering
S Ahmadian, A Epasto, M Knittel, R Kumar, M Mahdian, B Moseley, ...
arXiv preprint arXiv:2006.10221, 2020
Approximation algorithms for minimum-load k-facility location
S Ahmadian, B Behsaz, Z Friggstad, A Jorati, MR Salavatipour, C Swamy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
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
Approximation algorithms for clustering and facility location problems
S Ahmadian
University of Waterloo, 2017
Further approximations for demand matching: Matroid constraints and minor-closed graphs
S Ahmadian, Z Friggstad
arXiv preprint arXiv:1705.10396, 2017
An Algorithm for Construction of All Perfect Phylogeny Matrices
H Mirzaei, S Ahmadian, S Mahabadi, M Sadeghi, C Eslahchi, H Pezeshk
Match 62 (2), 251, 2009
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
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
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
The Wedge Picking Model: A dynamic graph model based on triadic closure
S Ahmadian, S Haddadan
arXiv preprint arXiv:2012.01691, 2020
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
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20