No. Title Author Year
1 A Tight Competitive Ratio for Online Submodular Welfare Maximization Ganz, Amit et al. 2023
2 An Improved Approximation Algorithm for the Max-3-Section Problem Katzelnick, Dor et al. 2023
3 Efficient and Equitable Natural Language Processing in the Age of Deep Learning (Dagstuhl Seminar 22232) Dodge, Jesse et al. 2023
4 Fair Correlation Clustering in General Graphs Schwartz, Roy et al. 2022
5 Fault Tolerant Max-Cut Censor-Hillel, Keren et al. 2021
6 Approximating Requirement Cut via a Configuration LP Schwartz, Roy et al. 2020
7 Maximizing the Correlation: Extending Grothendieck’s Inequality to Large Domains Katzelnick, Dor et al. 2020
8 A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints Mizrachi, Eyal et al. 2019
9 Graph Balancing with Orientation Costs Schwartz, Roy et al. 2019
10 Online and Offline Algorithms for Circuit Switch Scheduling Schwartz, Roy et al. 2019
11 Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification Chen, Shahar et al. 2017
12 Discrepancy Without Partial Colorings Harvey, Nicholas J. A. et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI