Volgen
Yury Makarychev
Titel
Geciteerd door
Geciteerd door
Jaar
O (√ log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems
A Agarwal, M Charikar, K Makarychev, Y Makarychev
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
2392005
Near-optimal algorithms for unique games
M Charikar, K Makarychev, Y Makarychev
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
1702006
A new class of non-Shannon-type inequalities for entropies
K Makarychev, Y Makarychev, A Romashchenko, N Vereshchagin
Communications in Information and Systems 2 (2), 147-166, 2002
1542002
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering
K Makarychev, Y Makarychev, I Razenshteyn
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
1482019
Integrality gaps for Sherali-Adams relaxations
M Charikar, K Makarychev, Y Makarychev
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1402009
The Grothendieck constant is strictly smaller than Krivine’s bound
M Braverman, K Makarychev, Y Makarychev, A Naor
Forum of Mathematics, Pi 1, e4, 2013
1132013
Near-optimal algorithms for maximum constraint satisfaction problems
M Charikar, K Makarychev, Y Makarychev
ACM Transactions on Algorithms (TALG) 5 (3), 32, 2009
1042009
Quadratic forms on graphs
N Alon, K Makarychev, Y Makarychev, A Naor
Inventiones mathematicae 163 (3), 499-522, 2006
1022006
The power of asymmetry in binary hashing
B Neyshabur, N Srebro, RR Salakhutdinov, Y Makarychev, ...
Advances in neural information processing systems 26, 2013
822013
How to play unique games using embeddings
E Chlamtac, K Makarychev, Y Makarychev
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
822006
Approximation algorithms for semi-random partitioning problems
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
812012
Bilu-Linial stable instances of max cut and minimum multiway cut
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
712014
Subgraph sparsification and nearly optimal ultrasparsifiers
A Kolla, Y Makarychev, A Saberi, SH Teng
Proceedings of the forty-second ACM symposium on Theory of computing, 57-66, 2010
712010
Algorithms for stable and perturbation-resilient problems
H Angelidakis, K Makarychev, Y Makarychev
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
702017
Metric extension operators, vertex sparsifiers and Lipschitz extendability
K Makarychev, Y Makarychev
Israel Journal of Mathematics 212 (2), 913-959, 2016
69*2016
Minimizing the union: Tight approximations for small set bipartite vertex expansion
E Chlamtáč, M Dinitz, Y Makarychev
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
642017
Approximation algorithms for socially fair clustering
Y Makarychev, A Vakilian
Conference on Learning Theory, 3246-3264, 2021
562021
How to play unique games against a semi-random adversary: Study of semi-random models of unique games
A Kolla, K Makarychev, Y Makarychev
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 443-452, 2011
562011
A Bi-Criteria Approximation Algorithm for k-Means
K Makarychev, Y Makarychev, M Sviridenko, J Ward
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
542016
Correlation Clustering with Noisy Partial Information
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the Conference on Learning Theory (COLT) 6, 2015
532015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20