Roy Schwartz

Affiliations:
  • Technion, Haifa, Israel
  • Microsoft Research, Redmond, WA, USA (former)
  • Technion, Haifa, Israel (PhD 2012)


According to our database1, Roy Schwartz authored at least 47 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Almost Logarithmic Approximation for Cutwidth and Pathwidth.
CoRR, 2023

A Simple Algorithm for Submodular Minimum Linear Ordering.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

An Improved Approximation Algorithm for the Max-3-Section Problem.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Tight Competitive Ratio for Online Submodular Welfare Maximization.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems.
ACM Trans. Algorithms, 2022

Fair Correlation Clustering in General Graphs.
Proceedings of the Approximation, 2022

2021
A refined analysis of submodular Greedy.
Oper. Res. Lett., 2021

Simplex Transformations and the Multiway Cut Problem.
Math. Oper. Res., 2021

The Metric Relaxation for 0-Extension Admits an Ω(log<sup>2/3</sup>k) Gap.
CoRR, 2021

A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.
CoRR, 2021

The metric relaxation for <i>0</i>-extension admits an <i>Ω(log<sup>2/3</sup>k)</i> gap.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Fault Tolerant Max-Cut.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Fair Correlation Clustering.
CoRR, 2020

Approximating Requirement Cut via a Configuration LP.
Proceedings of the Approximation, 2020

Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains.
Proceedings of the Approximation, 2020

2019
Online Submodular Maximization with Preemption.
ACM Trans. Algorithms, 2019

A simple algorithm for the multiway cut problem.
Oper. Res. Lett., 2019

Min-Max Correlation Clustering via MultiCut.
CoRR, 2019

Online and Offline Greedy Algorithms for Routing with Switching Costs.
CoRR, 2019

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Online and Offline Algorithms for Circuit Switch Scheduling.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Graph Balancing with Orientation Costs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem.
SIAM J. Comput., 2018

Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization.
Math. Oper. Res., 2017

Local Guarantees in Graph Cuts and Clustering.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
ACM Trans. Algorithms, 2016

2015
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization.
SIAM J. Comput., 2015

Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Min-Max Graph Partitioning and Small Set Expansion.
SIAM J. Comput., 2014

Non-Uniform Graph Partitioning.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Submodular Maximization with Cardinality Constraints.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Calendaring for wide area networks.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

Discrepancy Without Partial Colorings.
Proceedings of the Approximation, 2014

2013
On the Approximation of Submodular Functions
CoRR, 2013

Rank quantization.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

2012
Labelings and partitions of graphs.
PhD thesis, 2012

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem.
Proceedings of the COLT 2012, 2012

2011
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract).
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Unified Continuous Greedy Algorithm for Submodular Maximization.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Improved Approximations for k-Exchange Systems - (Extended Abstract).
Proceedings of the Algorithms - ESA 2011, 2011

Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract).
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
The directed circular arrangement problem.
ACM Trans. Algorithms, 2010

2009
Partitioning graphs into balanced components.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2005
Balanced metric labeling.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005


  Loading...