Mong-Jen Kao

National Yang Ming Chiao Tung University — Taiwan

Computer Science · Physical Sciences

6h-index108citations32works0.82yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(22), Advanced Graph Theory Research(16), Optimization and Search Problems(14), Computational Geometry and Mesh Generation(11), Vehicle Routing Optimization Methods(4)

Publications32 total

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
2025
Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
ArXiv.org·2025Open Access
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
arXiv (Cornell University)·2025Open Access
Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks
2024· 3 cited
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem
Society for Industrial and Applied Mathematics eBooks·2023· 5 cited
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
Algorithmica·2021· 7 cited
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost
arXiv (Cornell University)·2021· 2 citedOpen Access
Iterative Partial Rounding for Vertex Cover with Hard Capacities
Algorithmica·2020· 2 cited
A Survey on Capacitated Covering and Related Problems
2020
Tight approximation for partial vertex cover with hard capacities
Theoretical Computer Science·2019· 4 cited
The Multi-service Location Problems
Communications in computer and information science·2019
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity
Communications in computer and information science·2019
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities
Algorithmica·2018· 2 cited
Iterative Partial Rounding for Vertex Cover with Hard Capacities
2017· 7 citedOpen Access
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities
arXiv (Cornell University)·2016· 1 citedOpen Access
Iterative Partial Rounding for Vertex Cover with Hard Capacities
arXiv (Cornell University)·2016Open Access
Optimal time-convex hull for a straight-line highway in L-metrics
Computational Geometry·2015· 1 cited
Online dynamic power management with hard real-time guarantees
Theoretical Computer Science·2015· 9 cited
Capacitated Domination: Problem Complexity and Approximation Algorithms
Algorithmica·2013· 19 cited
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
arXiv (Cornell University)·2013Open Access
page 1 of 2Next →

Frequent Co-authors

Ignaz Rutter(7), Dorothea Wagner(7), D. T. Lee(6), Jian-Jia Chen(4), D. T. Lee(4), Bastian Katz(3), Marcus Krug(3), Chung-Shou Liao(2), Dong-Hyun Lee(2), Hai-Lun Tu(2), Der-Tsai Lee(2), Bang-Sin Dai(2), Hyung-Chan An(2), Changyeol Lee(2), M. W. Lee(2), Hanlin Chen(1), Eunpyeong Hung(1), Jia-Yau Shiau(1), Ching-Chi Lin(1), Shu‐Wei Chang(1)