The Power of Randomness and Continuity in Submodular Optimization

Publicaciones

A Simple Algorithm for Submodular Minimum Linear Ordering

Autores: Dor Katzelnick Roy Schwartz
Publicado en: Symposium on Simplicity in Algorithms (SOSA) 2023, 2023
Editor: SOSA 23

The Metric Relaxation for 0-Extension Admits an $\Omega(\log^{2/3}{k})$ Gap

Autores: Roy Schwartz Nitzan Tur
Publicado en: Symposium on Theory of Computing (STOC) 2021, 2021, Página(s) 1601-1614
Editor: ACM

Fault Tolerant Max Cut

Autores: Keren Censor-Hillel Noa Marelly Roy Schwartz Tigran Tonoyan
Publicado en: International Collquium on Automata, Languages and Programming (ICALP) 2021, 2021
Editor: ICALP 2021

A Tight Competitive Ratio for Online Submodular Welfare Maximization

Autores: Amit Ganz Pranav Nuti Roy Schwartz
Publicado en: European Symposium on Algorithms (ESA) 2023, 2023
Editor: ESA 2023

Fair Correlation Clustering in General Graphs

Autores: Roy Schwartz Roded Zats
Publicado en: International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2022, 2022
Editor: Dagshtul Research Online Publication Server

An Improved Approximation Algorithm for the Max-3-Section Problem

Autores: Dor Katzelnick Aditya Pillai Roy Schwartz Mohit Sinch
Publicado en: European Symposium on Algorithms (ESA) 2023, 2023
Editor: ESA 2023

A refined analysis of submodular Greedy

Autores: Ariel Kulik, Roy Schwartz, Hadas Shachnai
Publicado en: Operations Research Letters, Edición 49/4, 2021, Página(s) 507-514, ISSN 0167-6377
Editor: Elsevier BV
DOI: 10.1016/j.orl.2021.04.006

Buscando datos de OpenAIRE...

Publicaciones

Compartir esta página

Descargar