Author of the publication

Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem.

, , and . ISAAC, volume 181 of LIPIcs, page 21:1-21:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Centrality of Trees for Capacitated k-Center., , , , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 52-63. Springer, (2014)Improving christofides' algorithm for the s-t path TSP., , and . STOC, page 875-886. ACM, (2012)Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem., , and . ISAAC, volume 181 of LIPIcs, page 21:1-21:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximation Algorithms for Traveling Salesman Problems Based on Linear Programming Relaxations.. Cornell University, USA, (2012)Dynamic Facility Location via Exponential Clocks., , and . SODA, page 708-721. SIAM, (2015)LP-Based Algorithms for Capacitated Facility Location., , and . FOCS, page 256-265. IEEE Computer Society, (2014)Centrality of trees for capacitated k-center., , , , , and . Math. Program., 154 (1-2): 29-53 (2015)Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem., , and . CoRR, (2020)Online Graph Matching Problems with a Worst-Case Reassignment Budget., , , and . CoRR, (2020)Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem., , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 1-11. Springer, (2010)