Mong-Jen Kao

According to our database, Mong-Jen Kao authored at least 27 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem.

Mong-Jen Kao

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

On Min-Max Graph Balancing with Strict Negative Correlation Constraints.

Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost.

Mong-Jen Kao

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.

Eunpyeong Hung, Mong-Jen Kao

Algorithmica, 2022

2021

Improved LP-based Approximation Algorithms for Facility Location with Hard Capacities.

Mong-Jen Kao

CoRR, 2021

Iterative Partial Rounding for Vertex Cover with Hard Capacities.

Mong-Jen Kao

Algorithmica, 2021

2019

Tight approximation for partial vertex cover with hard capacities.

Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee

Theor. Comput. Sci., 2019

O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities.

Mong-Jen Kao, Hai-Lun Tu, D. T. Lee

Algorithmica, 2019

2018

Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.

Eunpyeong Hong, Mong-Jen Kao

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

The Multi-service Location Problems.

Hung-I Yu, Mong-Jen Kao, D. T. Lee

Proceedings of the New Trends in Computer Technologies and Applications, 2018

An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity.

Hai-Lun Tu, Mong-Jen Kao, D. T. Lee

Proceedings of the New Trends in Computer Technologies and Applications, 2018

2016

Optimal time-convex hull for a straight-line highway in L_p-metrics.

Bang-Sin Dai, Mong-Jen Kao, D. T. Lee

Comput. Geom., 2016

O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.

Mong-Jen Kao, Hai-Lun Tu, D. T. Lee

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Online dynamic power management with hard real-time guarantees.

Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner

Theor. Comput. Sci., 2015

Capacitated Domination: Problem Complexity and Approximation Algorithms.

Mong-Jen Kao, Han-Lin Chen, D. T. Lee

Algorithmica, 2015

2013

The density maximization problem in graphs.

Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner

J. Comb. Optim., 2013

Optimal Time-Convex Hull under the Lp Metrics

Bang-Sin Dai, Mong-Jen Kao, D. T. Lee

CoRR, 2013

Online Power-Managing Strategy with Hard Real-Time Guarantees

Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner

CoRR, 2013

Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch

Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner

CoRR, 2013

Optimal Time-Convex Hull under the L p Metrics.

Bang-Sin Dai, Mong-Jen Kao, D. T. Lee

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.

Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Capacitated Domination: Constant Factor Approximation for Planar Graphs

Mong-Jen Kao, D. T. Lee

CoRR, 2011

Capacitated Domination Problem.

Mong-Jen Kao, Chung-Shou Liao, D. T. Lee

Algorithmica, 2011

Capacitated Domination: Constant Factor Approximations for Planar Graphs.

Mong-Jen Kao, D. T. Lee

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Connecting Two Trees with Optimal Routing Cost.

Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Approximation Algorithms for the Capacitated Domination Problem.

Mong-Jen Kao, Han-Lin Chen

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2007

Capacitated Domination Problem.

Mong-Jen Kao, Chung-Shou Liao

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007