Следене
Morteza Zadimoghaddam
Morteza Zadimoghaddam
Research Scientist at Google
Потвърден имейл адрес: google.com - Начална страница
Заглавие
Позовавания
Позовавания
Година
Submodular secretary problem and extensions
MH Bateni, MT Hajiaghayi, M Zadimoghaddam
ACM Transactions on Algorithms (TALG) 9 (4), 1-23, 2013
1932013
The price of anarchy in network creation games
ED Demaine, MT Hajiaghayi, H Mahini, M Zadimoghaddam
ACM Transactions on Algorithms (TALG) 8 (2), 1-13, 2012
1672012
Online stochastic weighted matching: Improved approximation algorithms
B Haeupler, VS Mirrokni, M Zadimoghaddam
Internet and Network Economics: 7th International Workshop, WINE 2011 …, 2011
1422011
Randomized composable core-sets for distributed submodular maximization
V Mirrokni, M Zadimoghaddam
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1382015
Minimizing movement
ED Demaine, MT Hajiaghayi, H Mahini, AS Sayedi-Roshkhar, ...
ACM Transactions on Algorithms (TALG) 5 (3), 1-30, 2009
1232009
Minimizing the diameter of a network using shortcut edges
ED Demaine, M Zadimoghaddam
Scandinavian Workshop on Algorithm Theory, 420-431, 2010
1192010
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
E Kazemi, M Mitrovic, M Zadimoghaddam, S Lattanzi, A Karbasi
International Conference on Machine Learning, 3311-3320, 2019
1062019
Simultaneous approximations for adversarial and stochastic online budgeted allocation
VS Mirrokni, SO Gharan, M Zadimoghaddam
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1062012
Optimal coalition structure generation in cooperative graph games
Y Bachrach, P Kohli, V Kolmogorov, M Zadimoghaddam
Proceedings of the AAAI Conference on Artificial Intelligence 27 (1), 81-87, 2013
912013
Scalable deletion-robust submodular maximization: Data summarization with privacy and fairness constraints
E Kazemi, M Zadimoghaddam, A Karbasi
International conference on machine learning, 2544-2553, 2018
88*2018
Online submodular welfare maximization: Greedy beats 1/2 in random order
N Korula, V Mirrokni, M Zadimoghaddam
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
882015
Submodular maximization with nearly optimal approximation, adaptivity and query complexity
M Fahrbach, V Mirrokni, M Zadimoghaddam
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
842019
Greedy column subset selection: New bounds and distributed algorithms
J Altschuler, A Bhaskara, G Fu, V Mirrokni, A Rostamizadeh, ...
International conference on machine learning, 2539-2548, 2016
792016
Overcommitment in cloud services: Bin packing with chance constraints
MC Cohen, PW Keller, V Mirrokni, M Zadimoghaddam
Management Science 65 (7), 3255-3271, 2019
782019
Fast distributed submodular cover: Public-private data summarization
B Mirzasoleiman, M Zadimoghaddam, A Karbasi
Advances in Neural Information Processing Systems 29, 2016
752016
Edge-weighted online bipartite matching
M Fahrbach, Z Huang, R Tao, M Zadimoghaddam
Journal of the ACM 69 (6), 1-35, 2022
732022
Online stochastic matching with unequal probabilities
A Mehta, B Waggoner, M Zadimoghaddam
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
672014
Consistent hashing with bounded loads
V Mirrokni, M Thorup, M Zadimoghaddam
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
622018
Submodular optimization over sliding windows
A Epasto, S Lattanzi, S Vassilvitskii, M Zadimoghaddam
Proceedings of the 26th International Conference on World Wide Web, 421-430, 2017
602017
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity
M Fahrbach, V Mirrokni, M Zadimoghaddam
International Conference on Machine Learning, 1833--1842, 2019
59*2019
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20