| A tight linear time (1/2)-approximation for unconstrained submodular maximization N Buchbinder, M Feldman, J Seffi, R Schwartz SIAM Journal on Computing 44 (5), 1384-1402, 2015 | 532 | 2015 |
| Submodular maximization with cardinality constraints N Buchbinder, M Feldman, J Naor, R Schwartz Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 385 | 2014 |
| A unified continuous greedy algorithm for submodular maximization M Feldman, J Naor, R Schwartz 2011 IEEE 52nd annual symposium on foundations of computer science, 570-579, 2011 | 332 | 2011 |
| Calendaring for wide area networks S Kandula, I Menache, R Schwartz, SR Babbula Proceedings of the 2014 ACM conference on SIGCOMM, 515-526, 2014 | 198 | 2014 |
| Partitioning graphs into balanced components R Krauthgamer, J Naor, R Schwartz Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 149 | 2009 |
| Online submodular maximization with preemption N Buchbinder, M Feldman, R Schwartz ACM Transactions on Algorithms (TALG) 15 (3), 1-31, 2019 | 119 | 2019 |
| Min-max graph partitioning and small set expansion N Bansal, U Feige, R Krauthgamer, K Makarychev, V Nagarajan, J Seffi, ... SIAM Journal on Computing 43 (2), 872-904, 2014 | 96 | 2014 |
| SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling R Manokaran, J Naor, P Raghavendra, R Schwartz Proceedings of the fortieth annual ACM symposium on Theory of computing, 11-20, 2008 | 93 | 2008 |
| Comparing apples and oranges: Query trade-off in submodular maximization N Buchbinder, M Feldman, R Schwartz Mathematics of Operations Research 42 (2), 308-329, 2017 | 73 | 2017 |
| Nonmonotone submodular maximization via a structural continuous greedy algorithm M Feldman, J Naor, R Schwartz International Colloquium on Automata, Languages, and Programming, 342-353, 2011 | 67 | 2011 |
| Simplex partitioning via exponential clocks and the multiway cut problem N Buchbinder, J Naor, R Schwartz Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 66* | 2013 |
| Improved Approximations for k-Exchange Systems: M Feldman, J Naor, R Schwartz, J Ward European Symposium on Algorithms, 784-798, 2011 | 56 | 2011 |
| Improved competitive ratios for submodular secretary problems M Feldman, J Naor, R Schwartz International Workshop on Approximation Algorithms for Combinatorial …, 2011 | 56 | 2011 |
| Local guarantees in graph cuts and clustering M Charikar, N Gupta, R Schwartz International Conference on Integer Programming and Combinatorial …, 2017 | 35 | 2017 |
| Unsupervised svms: On the complexity of the furthest hyperplane problem Z Karnin, E Liberty, S Lovett, R Schwartz, O Weinstein Conference on Learning Theory, 2.1-2.17, 2012 | 32 | 2012 |
| Min-max correlation clustering via multicut S Ahmadi, S Khuller, B Saha International Conference on Integer Programming and Combinatorial …, 2019 | 27 | 2019 |
| All-or-nothing generalized assignment with application to scheduling advertising campaigns R Adany, M Feldman, E Haramaty, R Khandekar, B Schieber, R Schwartz, ... ACM Transactions on Algorithms (TALG) 12 (3), 1-25, 2016 | 20 | 2016 |
| The directed circular arrangement problem J Naor, R Schwartz ACM Transactions on Algorithms (TALG) 6 (3), 1-22, 2010 | 19* | 2010 |
| Sticky brownian rounding and its applications to constraint satisfaction problems S Abbasi-Zadeh, N Bansal, G Guruganesh, A Nikolov, R Schwartz, ... ACM Transactions on Algorithms (TALG) 18 (4), 1-50, 2022 | 18 | 2022 |
| On the approximation of submodular functions NR Devanur, S Dughmi, R Schwartz, A Sharma, M Singh arXiv preprint arXiv:1304.4948, 2013 | 18 | 2013 |
Joseph Seffi NaorTechnion確認したメール アドレス: cs.technion.ac.il
