Author of the publication

Tight Approximation Bounds for Maximum Multi-coverage.

, , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 66-77. Springer, (2020)

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

Constraint Satisfaction Problems with Advice., , and . CoRR, (2024)Approximating CSPs with Outliers., and . APPROX/RANDOM, volume 245 of LIPIcs, page 43:1-43:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Combinatorial Lower Bounds for 3-Query LDCs., , and . ITCS, volume 151 of LIPIcs, page 85:1-85:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . J. ACM, 68 (3): 16:1-16:40 (2021)Tight approximation bounds for maximum multi-coverage., , , and . Math. Program., 192 (1): 443-476 (2022)Hardness of Learning DNFs using Halfspaces., and . Electron. Colloquium Comput. Complex., (2019)Tight Approximation Bounds for Maximum Multi-Coverage., , , and . CoRR, (2019)Approximation Algorithms and Hardness for Strong Unique Games., and . SODA, page 414-433. SIAM, (2021)New Approximation Bounds for Small-Set Vertex Expansion., and . SODA, page 2363-2375. SIAM, (2024)Tight Approximation Bounds for Maximum Multi-coverage., , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 66-77. Springer, (2020)