( en | de | ru )

 

Disambiguation of "Kao, Mong-Jen"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Approximation for Partial Vertex Cover with Hard Capacities.

, , , and . ISAAC, volume 92 of LIPIcs, page 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Jen-Jen Lin

Mohammed Abd El Fattah Mongi

Odej Kao

Daniela Kao

Apollinaire Mong

 

Other publications of authors with the same name

Iterative Partial Rounding for Vertex Cover with Hard Capacities.. Algorithmica, 83 (1): 45-71 (2021)An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity., , and . ICS, volume 1013 of Communications in Computer and Information Science, page 468-475. Springer, (2018)Approximation Algorithm for Vertex Cover with Multiple Covering Constraints., and . ISAAC, volume 123 of LIPIcs, page 43:1-43:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Approximation Algorithm for Vertex Cover with Multiple Covering Constraints., and . Algorithmica, 84 (1): 1-12 (2022)On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem.. SODA, page 1071-1089. SIAM, (2023)O(f) Bi-Approximation for Capacitated Covering with Hard Capacities., , and . ISAAC, volume 64 of LIPIcs, page 40:1-40:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 75-84. Springer, (2012)Tight Approximation for Partial Vertex Cover with Hard Capacities., , , and . ISAAC, volume 92 of LIPIcs, page 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost.. ISAAC, volume 283 of LIPIcs, page 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks., , , , and . INFOCOM, page 111-120. IEEE, (2024)