Mong-Jen Kao

40 papers A* 4A 3B 10Misc 2Journal 20Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics.
FOCS
Hyung-Chan An, Mong-Jen Kao, Changyeol Lee, Mu-Ting Lee
2025 J jnl
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics.
CoRR
Hyung-Chan An, Mong-Jen Kao, Changyeol Lee, Mu-Ting Lee
2025 J jnl
Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling.
CoRR
Yi-Ting Hsieh, Mong-Jen Kao, Jhong-Yun Liu, Hung-Lung Wang
2024 A* conf
Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks.
INFOCOM
Shu-Wei Chang, Jian-Jhih Kuo, Mong-Jen Kao, Bozhong Chen, Qian-Jing Wang
2024 B conf
On the Connected Minimum Sum of Radii Problem.
ISAAC
Hyung-Chan An, Mong-Jen Kao
2023 B conf
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost.
ISAAC
Mong-Jen Kao
2023 B conf
On Min-Max Graph Balancing with Strict Negative Correlation Constraints.
ISAAC
Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao
2023 A* conf
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem.
SODA
Mong-Jen Kao
2022 J jnl
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.
Algorithmica
Eunpyeong Hung, Mong-Jen Kao
2021 J jnl
Improved LP-based Approximation Algorithms for Facility Location with Hard Capacities.
CoRR
Mong-Jen Kao
2021 J jnl
Iterative Partial Rounding for Vertex Cover with Hard Capacities.
Algorithmica
Mong-Jen Kao
2019 J jnl
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities.
Algorithmica
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2019 J jnl
Tight approximation for partial vertex cover with hard capacities.
Theor. Comput. Sci.
Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee
2018 A conf
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity.
ICS
Hai-Lun Tu, Mong-Jen Kao, D. T. Lee
2018 B conf
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.
ISAAC
Eunpyeong Hong, Mong-Jen Kao
2018 A conf
The Multi-service Location Problems.
ICS
Hung-I Yu, Mong-Jen Kao, D. T. Lee
2017 A* conf
Iterative Partial Rounding for Vertex Cover with Hard Capacities.
SODA
Mong-Jen Kao
2017 B conf
Tight Approximation for Partial Vertex Cover with Hard Capacities.
ISAAC
Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee
2016 J jnl
Iterative Partial Rounding for Vertex Cover with Hard Capacities.
CoRR
Mong-Jen Kao
2016 B conf
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
ISAAC
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2016 J jnl
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
CoRR
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
2016 J jnl
Optimal time-convex hull for a straight-line highway in L
Comput. Geom.
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
2015 J jnl
Capacitated Domination: Problem Complexity and Approximation Algorithms.
Algorithmica
Mong-Jen Kao, Han-Lin Chen, D. T. Lee
2015 J jnl
Online dynamic power management with hard real-time guarantees.
Theor. Comput. Sci.
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2014 A conf
Online Dynamic Power Management with Hard Real-Time Guarantees.
STACS
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013 J jnl
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
CoRR
Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner
2013 J jnl
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
CoRR
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2013 J jnl
Online Power-Managing Strategy with Hard Real-Time Guarantees
CoRR
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013 B conf
Optimal Time-Convex Hull under the L p Metrics.
WADS
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
2013 J jnl
Optimal Time-Convex Hull under the Lp Metrics
CoRR
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
2013 J jnl
The density maximization problem in graphs.
J. Comb. Optim.
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2012 B conf
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
ISAAC
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2011 J jnl
Capacitated Domination Problem.
Algorithmica
Mong-Jen Kao, Chung-Shou Liao, D. T. Lee
2011 J jnl
Capacitated Domination: Constant Factor Approximation for Planar Graphs
CoRR
Mong-Jen Kao, D. T. Lee
2011 B conf
Capacitated Domination: Constant Factor Approximations for Planar Graphs.
ISAAC
Mong-Jen Kao, D. T. Lee
2011 — conf
Connecting Two Trees with Optimal Routing Cost.
CCCG
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner
2011 Misc conf
The Density Maximization Problem in Graphs.
COCOON
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2010 J jnl
Approximation Algorithms for the Capacitated Domination Problem
CoRR
Mong-Jen Kao, Han-Lin Chen
2010 Misc conf
Approximation Algorithms for the Capacitated Domination Problem.
FAW
Mong-Jen Kao, Han-Lin Chen
2007 B conf
Capacitated Domination Problem.
ISAAC
Mong-Jen Kao, Chung-Shou Liao