Author of the publication

Tight Approximation for Proportional Approval Voting.

, , , and . IJCAI, page 276-282. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..

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

Online Facility Location with Linear Delay., , , and . CoRR, (2021)Submodularity Gaps for Selected Network Design and Matching Problems., , , and . CoRR, (2023)Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems., , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 48-64. Springer, (2021)Constant-Factor FPT Approximation for Capacitated k-Median., , , , and . ESA, volume 144 of LIPIcs, page 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tight Approximation Ratio for Minimum Maximal Matching., , and . CoRR, (2018)Constant factor FPT approximation for capacitated k-median., , , , and . CoRR, (2018)A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem., , , and . CoRR, (2015)Tight Approximation for Proportional Approval Voting., , , and . IJCAI, page 276-282. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks., , , and . SIGMETRICS Perform. Evaluation Rev., 48 (3): 99-108 (2020)Tight Approximation Ratio for Minimum Maximal Matching., , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 181-193. Springer, (2019)