Author of the publication

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.

, , , and . ICALP, volume 132 of LIPIcs, page 85:1-85:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems, , , , , and . (2018)cite arxiv:1812.07769.All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns., , , , , , , and . ACM Trans. Algorithms, 12 (3): 38:1-38:25 (2016)A simple algorithm for the multiway cut problem., , and . Oper. Res. Lett., 47 (6): 587-593 (2019)Simplex Transformations and the Multiway Cut Problem., , and . Math. Oper. Res., 46 (2): 757-771 (2021)On the Power of Saturated Transformers: A View from Circuit Complexity., , , and . CoRR, (2021)Green AI., , , and . Commun. ACM, 63 (12): 54-63 (2020)A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization., , , and . SIAM J. Comput., 44 (5): 1384-1402 (2015)Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem., , and . SIAM J. Comput., 47 (4): 1463-1482 (2018)Fewer Errors, but More Stereotypes? The Effect of Model Size on Gender Bias., , and . CoRR, (2022)Simplex Transformations and the Multiway Cut Problem., , and . SODA, page 2400-2410. SIAM, (2017)