Roy Schwartz

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint	2024	Yuval Filmus Roy Schwartz Alexander Smal
+	An Improved Approximation Algorithm for the Max-$3$-Section Problem	2023	Dor Katzelnick Aditya Pillai Roy Schwartz Mohit Singh
+	A Tight Competitive Ratio for Online Submodular Welfare Maximization	2023	Amit Ganz Pranav Nuti Roy Schwartz
+	Almost Logarithmic Approximation for Cutwidth and Pathwidth	2023	Nikhil Bansal Dor Katzelnick Roy Schwartz
+ PDF Chat	Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	2022	Sepehr Abbasi-Zadeh Nikhil Bansal Guru Guruganesh Aleksandar Nikolov Roy Schwartz Mohit Singh
+	The Metric Relaxation for 000-Extension Admits an \Omega(\log^{\nicefrac[]{2}{3}}{k}) Gap	2021	Roy Schwartz Nitzan Tur
+ PDF Chat	The metric relaxation for <i>0</i> -extension admits an <i> Ω(log <sup>2/3</sup> k) </i> gap	2021	Roy Schwartz Nitzan Tur
+	Fault Tolerant Max-Cut	2021	Keren Censor-Hillel Noa Marelly Roy Schwartz Tigran Tonoyan
+	A refined analysis of submodular Greedy	2021	Ariel Kulik Roy Schwartz Hadas Shachnai
+	A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.	2021	Ariel Kulik Roy Schwartz Hadas Shachnai
+	A Refined Analysis of Submodular Greedy	2021	Ariel Kulik Roy Schwartz Hadas Shachnai
+	Graph Balancing with Orientation Costs	2021	Roy Schwartz Ran Yeheskel
+	Fault Tolerant Max-Cut	2021	Keren Censor-Hillel Noa Marelly Roy Schwartz Tigran Tonoyan
+	Fair Correlation Clustering.	2020	Saba Ahmadi Sainyam Galhotra Barna Saha Roy Schwartz
+	Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains.	2020	Dor Katzelnick Roy Schwartz
+ PDF Chat	Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	2019	Sepehr Abbasi-Zadeh Nikhil Bansal Guru Guruganesh Aleksandar Nikolov Roy Schwartz Mohit Singh
+	Min-Max Correlation Clustering via MultiCut.	2019	Saba Ahmadi Sainyam Galhotra Samir Khuller Barna Saha Roy Schwartz
+ PDF Chat	Online Submodular Maximization with Preemption	2019	Niv Buchbinder Moran Feldman Roy Schwartz
+	Online and Offline Greedy Algorithms for Routing with Switching Costs	2019	Roy Schwartz Mohit Singh Sina Yazdanbod
+	Graph Balancing with Orientation Costs.	2019	Roy Schwartz Ran Yeheskel
+	A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints	2018	Eyal Mizrachi Roy Schwartz Joachim Spoerhase Sumedha Uniyal
+ PDF Chat	Local Guarantees in Graph Cuts and Clustering	2017	Moses Charikar Neha Gupta Roy Schwartz
+ PDF Chat	Comparing Apples and Oranges: Query Trade-off in Submodular Maximization	2016	Niv Buchbinder Moran Feldman Roy Schwartz
+ PDF Chat	Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization	2014	Niv Buchbinder Moran Feldman Roy Schwartz
+	Online Submodular Maximization with Preemption	2014	Niv Buchbinder Moran Feldman Roy Schwartz
+	Discrepancy Without Partial Colorings	2014	Nicholas J. A. Harvey Roy Schwartz Mohit Singh
+	On the Approximation of Submodular Functions	2013	Nikhil R. Devanur Shaddin Dughmi Roy Schwartz Ankit Sharma Mohit Singh
+	Min-Max Graph Partitioning and Small Set Expansion	2011	Nikhil Bansal Uriel Feige Robert Krauthgamer Konstantin Makarychev Viswanath Nagarajan Joseph Joseph Naor Roy Schwartz
+	Min-Max Graph Partitioning and Small Set Expansion	2011	Nikhil Bansal Uriel Feige Robert Krauthgamer Konstantin Makarychev Viswanath Nagarajan Naor Roy Schwartz

Common Coauthors

Coauthor	Papers Together
Mohit Singh	6
Nikhil Bansal	5
Moran Feldman	4
Niv Buchbinder	4
Ariel Kulik	3
Hadas Shachnai	3
Dor Katzelnick	3
Barna Saha	2
Uriel Feige	2
Noa Marelly	2
Konstantin Makarychev	2
Tigran Tonoyan	2
Robert Krauthgamer	2
Sainyam Galhotra	2
Saba Ahmadi	2
Naor	2
Viswanath Nagarajan	2
Aleksandar Nikolov	2
Keren Censor-Hillel	2
Guru Guruganesh	2
Ran Yeheskel	2
Nitzan Tur	2
Sepehr Abbasi-Zadeh	2
Eyal Mizrachi	1
Ankit Sharma	1
Aditya Pillai	1
Sumedha Uniyal	1
Nicholas J. A. Harvey	1
Moses Charikar	1
Pranav Nuti	1
Joseph Joseph	1
Alexander Smal	1
Sina Yazdanbod	1
Samir Khuller	1
Amit Ganz	1
Shaddin Dughmi	1
Joachim Spoerhase	1
Yuval Filmus	1
Nikhil R. Devanur	1
Neha Gupta	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming	1995	Michel X. Goemans David P. Williamson	9
+ PDF Chat	Symmetry and Approximability of Submodular Maximization Problems	2013	J. Vondrák	4
+ PDF Chat	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut	2004	David R. Karger Philip N. Klein Clifford Stein Mikkel Thorup Neal E. Young	3
+	How to Play Unique Games Using Embeddings	2006	Eden Chlamtáč Konstantin Makarychev Yury Makarychev	3
+	Near-optimal Nonmyopic Value of Information in Graphical Models	2012	Andreas Krause Carlos Guestrin	3
+ PDF Chat	Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs	2015	Shuchi Chawla Konstantin Makarychev Tselil Schramm Grigory Yaroslavtsev	3
+ PDF Chat	Comments on bases in dependence structures	1969	Richard A. Brualdi	2
+ PDF Chat	Constructive Discrepancy Minimization by Walking on the Edges	2015	Shachar Lovett Raghu Meka	2
+ PDF Chat	Approximate graph coloring by semidefinite programming	1998	David R. Karger Rajeev Motwani Madhu Sudan	2
+ PDF Chat	Rounding Semidefinite Programming Hierarchies via Global Correlation	2011	Boaz Barak Prasad Raghavendra David Steurer	2
+	Noise stability of functions with low influences: invariance and optimality	2005	Elchanan Mossel Ryan O’Donnell Krzysztof Oleszkiewicz	2
+	Reductions Between Expansion Problems	2010	Prasad Raghavendra David Steurer Madhur Tulsiani	2
+	A .699-approximation algorithm for Max-Bisection	2001	Yinyu Ye	2
+	Maximizing Quadratic Programs: Extending Grothendieck's Inequality	2004	Moses Charikar Anthony Wirth	2
+ PDF Chat	Practical Budgeted Submodular Maximization	2022	Moran Feldman Zeev Nutov Elad Shoham	2
+ PDF Chat	Expander flows, geometric embeddings and graph partitioning	2009	Sanjeev Arora Satish Rao Umesh Vazirani	2
+ PDF Chat	Local Guarantees in Graph Cuts and Clustering	2017	Moses Charikar Neha Gupta Roy Schwartz	2
+ PDF Chat	A $(\log n)^{\Omega(1)}$ Integrality Gap for the Sparsest Cut SDP	2009	Jeff Cheeger Bruce Kleiner Assaf Naor	2
+	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs	1999	Eran Halperin Uri Zwick	2
+	Krivine diffusions attain the Goemans--Williamson approximation ratio	2019	Ronen Eldan Assaf Naor	2
+ PDF Chat	Learning with Submodular Functions: A Convex Optimization Perspective	2013	Francis Bach	2
+	Stochastic Differential Equations	1995	Bernt Øksendal	2
+ PDF Chat	The rate of convergence of the Walk on Spheres Algorithm	2012	Ilia Binder Mark Braverman	2
+ PDF Chat	The Gram-Schmidt walk: a cure for the Banaszczyk blues	2018	Nikhil Bansal Daniel Dadush Shashwat Garg Shachar Lovett	2
+	Complex Analysis: An Introduction to the Theory of Analytic Functions of One Complex Variable.	1968	Syed Muslim Shah Lars V. Ahlfors	2
+	Lp metrics on the Heisenberg group and the Goemans-Linial conjecture	2006	James Lee Assaf Naor	2
+	Semidefinite relaxation and nonconvex quadratic optimization	1998	Yu. Nesterov	2
+	Comparison theorems for differential equations	1986	A. McNabb	2
+	Tight Hardness Results for Minimizing Discrepancy	2011	Moses Charikar Alantha Newman Aleksandar Nikolov	2
+ PDF Chat	Constructive Algorithms for Discrepancy Minimization	2010	Nikhil Bansal	2
+	Approximations for the isoperimetric and spectral profile of graphs and related parameters	2010	Prasad Raghavendra David Steurer Prasad Tetali	2
+ PDF Chat	Min-Max Correlation Clustering via MultiCut	2019	Saba Ahmadi Samir Khuller Barna Saha	2
+	Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint	2021	Jing Tang Xueyan Tang Andrew Lim Kai Han Chongshou Li Junsong Yuan	2
+	Directed spanners via flow-based linear programs	2011	Michael Dinitz Robert Krauthgamer	1
+ PDF Chat	Vertex Sparsifiers: New Results from Old Techniques	2010	Matthias Englert Anupam Gupta Robert Krauthgamer Harald Räcke Inbal Talgam-Cohen Kunal Talwar	1
+ PDF Chat	Submodular Approximation: Sampling-based Algorithms and Lower Bounds	2011	Zoya Svitkina Lisa Fleischer	1
+ PDF Chat	Simultaneous Approximation of Constraint Satisfaction Problems	2015	Amey Bhangale Swastik Kopparty Sushant Sachdeva	1
+ PDF Chat	On the configuration-LP for scheduling on unrelated machines	2013	José Verschae Andreas Wiese	1
+ PDF Chat	Elliptic Partial Differential Equations of Second Order	2001	David Gilbarg Neil S. Trudinger	1
+ PDF Chat	Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability	2010	Konstantin Makarychev Yury Makarychev	1
+	Outward rotations	1999	Uri Zwick	1
+ PDF Chat	Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization	2014	Norman Huang Allan Borodin	1
+	The discrepancy method: randomness and complexity	2002	Bernard Chazelle	1
+ PDF Chat	Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms	2010	Anupam Gupta Aaron Roth Grant Schoenebeck Kunal Talwar	1
+ PDF Chat	Six standard deviations suffice	1985	Joel Spencer	1
+ PDF Chat	Dual Failure Resilient BFS Structure	2015	Merav Parter	1
+ PDF Chat	Symmetry and Approximability of Submodular Maximization Problems	2009	J. Vondrák	1
+	None	2010	Alexander Barvinok Zur Luria Alex Samorodnitsky Alexander Yong	1
+	Balancing vectors and Gaussian measures ofn-dimensional convex bodies	1998	Wojciech Banaszczyk	1
+ PDF Chat	None	2006	Eyal Rozenman Aner Shalev Avi Wigderson	1