Roy Schwartz

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 41

Top Topics

Greedy Algorithm

Correlation Clustering

Graph Partitioning

Constraint Satisfaction

Top Venues

Publications

Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh
An Improved Approximation Algorithm for the Max-3-Section Problem. ESA (2023)
Amit Ganz, Pranav Nuti, Roy Schwartz
A Tight Competitive Ratio for Online Submodular Welfare Maximization. ESA (2023)
Amit Ganz, Pranav Nuti, Roy Schwartz
A Tight Competitive Ratio for Online Submodular Welfare Maximization. CoRR (2023)
Nikhil Bansal, Dor Katzelnick, Roy Schwartz
Almost Logarithmic Approximation for Cutwidth and Pathwidth. CoRR (2023)
Dor Katzelnick, Roy Schwartz
A Simple Algorithm for Submodular Minimum Linear Ordering. SOSA (2023)
Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh
An Improved Approximation Algorithm for the Max-3-Section Problem. CoRR (2023)
Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms 18 (4) (2022)
Roy Schwartz, Roded Zats
Fair Correlation Clustering in General Graphs. APPROX/RANDOM (2022)
Roy Schwartz, Nitzan Tur
gap. STOC (2021)
Ariel Kulik, Roy Schwartz, Hadas Shachnai
A refined analysis of submodular Greedy. Oper. Res. Lett. 49 (4) (2021)
Roy Schwartz, Nitzan Tur
k) Gap. CoRR (2021)
Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan
Fault Tolerant Max-Cut. CoRR (2021)
Niv Buchbinder, Roy Schwartz, Baruch Weizman
Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. 46 (2) (2021)
Ariel Kulik, Roy Schwartz, Hadas Shachnai
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR (2021)
Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan
Fault Tolerant Max-Cut. ICALP (2021)
Roy Schwartz, Ran Yeheskel
Graph Balancing with Orientation Costs. CoRR (2021)
Dor Katzelnick, Roy Schwartz
Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains. APPROX-RANDOM (2020)
Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. SODA (2020)
Roy Schwartz, Yotam Sharoni
Approximating Requirement Cut via a Configuration LP. APPROX-RANDOM (2020)
Saba Ahmadi, Sainyam Galhotra, Barna Saha, Roy Schwartz
Fair Correlation Clustering. CoRR (2020)
Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. ICALP (2019)
Niv Buchbinder, Roy Schwartz, Baruch Weizman
A simple algorithm for the multiway cut problem. Oper. Res. Lett. 47 (6) (2019)
Roy Schwartz, Mohit Singh, Sina Yazdanbod
Online and Offline Algorithms for Circuit Switch Scheduling. FSTTCS (2019)
Saba Ahmadi, Sainyam Galhotra, Samir Khuller, Barna Saha, Roy Schwartz
Min-Max Correlation Clustering via MultiCut. CoRR (2019)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15 (3) (2019)
Roy Schwartz, Ran Yeheskel
Graph Balancing with Orientation Costs. ESA (2019)
Roy Schwartz, Mohit Singh, Sina Yazdanbod
Online and Offline Greedy Algorithms for Routing with Switching Costs. CoRR (2019)
Harald Räcke, Roy Schwartz, Richard Stotz
Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. SPAA (2018)
Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47 (4) (2018)
Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. CoRR (2018)
Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. CoRR (2018)
Moses Charikar, Neha Gupta, Roy Schwartz
Local Guarantees in Graph Cuts and Clustering. CoRR (2017)
Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz
Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. ICALP (2017)
Niv Buchbinder, Roy Schwartz, Baruch Weizman
Simplex Transformations and the Multiway Cut Problem. SODA (2017)
Moses Charikar, Neha Gupta, Roy Schwartz
Local Guarantees in Graph Cuts and Clustering. IPCO (2017)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42 (2) (2017)
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12 (3) (2016)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44 (5) (2015)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA (2015)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Online Submodular Maximization with Preemption. SODA (2015)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Online Submodular Maximization with Preemption. CoRR (2015)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
Submodular Maximization with Cardinality Constraints. SODA (2014)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR (2014)
Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar
Non-Uniform Graph Partitioning. SODA (2014)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43 (2) (2014)
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO (2013)
Ravi Kumar, Ronny Lempel, Roy Schwartz, Sergei Vassilvitskii
Rank quantization. WSDM (2013)
Niv Buchbinder, Joseph Naor, Roy Schwartz
Simplex partitioning via exponential clocks and the multiway cut problem. STOC (2013)
Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. COLT (2012)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS (2012)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion CoRR (2011)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-max Graph Partitioning and Small Set Expansion. FOCS (2011)
Moran Feldman, Joseph Naor, Roy Schwartz
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS (2011)
Moran Feldman, Joseph Naor, Roy Schwartz
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) (2011)
Moran Feldman, Joseph Naor, Roy Schwartz
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM (2011)
Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA (2011)
Joseph Naor, Roy Schwartz
The directed circular arrangement problem. ACM Trans. Algorithms 6 (3) (2010)
Robert Krauthgamer, Joseph Naor, Roy Schwartz
Partitioning graphs into balanced components. SODA (2009)
Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC (2008)
Joseph Naor, Roy Schwartz
Balanced metric labeling. STOC (2005)
Joseph Naor, Roy Schwartz
The directed circular arrangement problem. SODA (2004)