Grigory Yaroslavtsev

1. Near Optimal LP Rounding Algorithm for Correlation Clustering on\n Complete and Complete k-partite Graphs
   2014/12/01 by Shuchi Chawla, Chawla, Shuchi, Konstantin Makarychev +5 · 10 citations
   Business, Management and Accounting · Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Facility Location and Emergency Management
2. Parallel Algorithms for Geometric Graph Problems
   2013/12/30 by Alexandr Andoni, Andoni, Alexandr, Aleksandar Nikolov +5 · 8 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
3. Optimal Sample Complexity of Contrastive Learning
   2023/12/01 by Noga Alon, Dmitrii Avdiukhin, Alon, Noga +7 · 5 citations
   Computer Science · #Domain Adaptation and Few-Shot Learning #FOS: Computer and information sciences #Face and Expression Recognition #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms
4. Adversarially Robust Submodular Maximization under Knapsack Constraints
   2019/05/07 by Dmitrii Avdiukhin, Slobodan Mitrović, Avdiukhin, Dmitrii +5 · 2 citations
   Computer Science · #Adversarial Robustness in Machine Learning #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
5. Steiner Transitive-Closure Spanners of d-Dimensional Posets
   2010/11/28 by Piotr Berman, Berman, Piotr, Arnab Bhattacharyya +9 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
6. Going for Speed: Sublinear Algorithms for Dense r-CSPs
   2014/07/29 by Grigory Yaroslavtsev, Yaroslavtsev, Grigory · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems
7. "Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
   2019/10/12 by Dmitrii Avdiukhin, Avdiukhin, Dmitrii, Grigory Yaroslavtsev +3 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Optimization and Search Problems