Approximating Fractional and Generalized Hypertree Width via Semidefinite Programming
Autori:
Shay Ben Ezra
Roy Schwartz
Pubblicato in:
under submission, 2026
Editore:
under submission
A Poisson Process for Submodular Maximization
Autori:
Ariel Kulik
Amit Ganz
Roy Schwartz
Mohit Singh
Pubblicato in:
under submission, 2026
Editore:
under submission
A Simple Algorithm for Submodular Minimum Linear Ordering
Autori:
Dor Katzelnick
Roy Schwartz
Pubblicato in:
Symposium on Simplicity in Algorithms (SOSA) 2023, 2023
Editore:
SOSA 23
The Metric Relaxation for 0-Extension Admits an $\Omega(\log^{2/3}{k})$ Gap
Autori:
Roy Schwartz
Nitzan Tur
Pubblicato in:
Symposium on Theory of Computing (STOC) 2021, 2021, Pagina/e 1601-1614
Editore:
ACM
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
Autori:
Yuval Filmus
Roy Schwartz
Alexander V. Smal
Pubblicato in:
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2025, 2025
Editore:
IPCO 2025
Fault Tolerant Max Cut
Autori:
Keren Censor-Hillel
Noa Marelly
Roy Schwartz
Tigran Tonoyan
Pubblicato in:
International Collquium on Automata, Languages and Programming (ICALP) 2021, 2021
Editore:
ICALP 2021
A Tight Competitive Ratio for Online Submodular Welfare Maximization
Autori:
Amit Ganz
Pranav Nuti
Roy Schwartz
Pubblicato in:
European Symposium on Algorithms (ESA) 2023, 2023
Editore:
ESA 2023
Fair Correlation Clustering in General Graphs
Autori:
Roy Schwartz
Roded Zats
Pubblicato in:
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2022, 2022
Editore:
Dagshtul Research Online Publication Server
An Improved Approximation Algorithm for the Max-3-Section Problem
Autori:
Dor Katzelnick
Aditya Pillai
Roy Schwartz
Mohit Sinch
Pubblicato in:
European Symposium on Algorithms (ESA) 2023, 2023
Editore:
ESA 2023
On Approximating Cutwidth and Pathwidth
Autori:
Nikhil Bansal
Dor Katzelnick
Roy Schwartz
Pubblicato in:
Symposium on Foundations of Computer Science (FOCS) 2024, 2024
Editore:
FOCS 2024
Tight Hardness and Algorithm for Submodular Linear Ordering
Autori:
Evan Abboud
Roy Schwartz
Pubblicato in:
waiting for submission, 2026
Editore:
waiting for submission
