Mong-Jen Kao

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 18

Top Topics

Top Venues

Publications

Shu-Wei Chang, Jian-Jhih Kuo, Mong-Jen Kao, Bozhong Chen, Qian-Jing Wang
Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks. INFOCOM (2024)
Mong-Jen Kao
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. ISAAC (2023)
Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao
On Min-Max Graph Balancing with Strict Negative Correlation Constraints. ISAAC (2023)
Mong-Jen Kao
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem. SODA (2023)
Eunpyeong Hung, Mong-Jen Kao
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. Algorithmica 84 (1) (2022)
Mong-Jen Kao
Improved LP-based Approximation Algorithms for Facility Location with Hard Capacities. CoRR (2021)
Mong-Jen Kao
Iterative Partial Rounding for Vertex Cover with Hard Capacities. Algorithmica 83 (1) (2021)
Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee
Tight approximation for partial vertex cover with hard capacities. Theor. Comput. Sci. 778 (2019)
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. Algorithmica 81 (5) (2019)
Eunpyeong Hong, Mong-Jen Kao
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. ISAAC (2018)
Hung-I Yu, Mong-Jen Kao, D. T. Lee
The Multi-service Location Problems. ICS (2018)
Hai-Lun Tu, Mong-Jen Kao, D. T. Lee
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. ICS (2018)
Mong-Jen Kao
Iterative Partial Rounding for Vertex Cover with Hard Capacities. SODA (2017)
Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee
Tight Approximation for Partial Vertex Cover with Hard Capacities. ISAAC (2017)
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. CoRR (2016)
Mong-Jen Kao
Iterative Partial Rounding for Vertex Cover with Hard Capacities. CoRR (2016)
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. ISAAC (2016)
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
-metrics. Comput. Geom. 53 (2016)
Mong-Jen Kao, Han-Lin Chen, Der-Tsai Lee
Capacitated Domination: Problem Complexity and Approximation Algorithms. Algorithmica 72 (1) (2015)
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. 595 (2015)
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
Online Dynamic Power Management with Hard Real-Time Guarantees. STACS (2014)
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. CoRR (2013)
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
The density maximization problem in graphs. J. Comb. Optim. 26 (4) (2013)
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
Online Power-Managing Strategy with Hard Real-Time Guarantees CoRR (2013)
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
Optimal Time-Convex Hull under the Lp Metrics CoRR (2013)
Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch CoRR (2013)
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
Optimal Time-Convex Hull under the L p Metrics. WADS (2013)
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC (2012)
Mong-Jen Kao, Chung-Shou Liao, D. T. Lee
Capacitated Domination Problem. Algorithmica 60 (2) (2011)
Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner
Connecting Two Trees with Optimal Routing Cost. CCCG (2011)
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
The Density Maximization Problem in Graphs. COCOON (2011)
Mong-Jen Kao, D. T. Lee
Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC (2011)
Mong-Jen Kao, D. T. Lee
Capacitated Domination: Constant Factor Approximation for Planar Graphs CoRR (2011)
Mong-Jen Kao, Han-Lin Chen
Approximation Algorithms for the Capacitated Domination Problem. FAW (2010)
Mong-Jen Kao, Han-Lin Chen
Approximation Algorithms for the Capacitated Domination Problem CoRR (2010)
Mong-Jen Kao, Chung-Shou Liao
Capacitated Domination Problem. ISAAC (2007)