×
Author ID: kao.mong-jen Recent zbMATH articles by "Kao, Mong-Jen"
Published as: Kao, Mong-Jen
Documents Indexed: 21 Publications since 2007
Co-Authors: 13 Co-Authors with 18 Joint Publications
462 Co-Co-Authors

Citations contained in zbMATH Open

13 Publications have been cited 42 times in 29 Documents Cited by Year
Capacitated domination: problem complexity and approximation algorithms. Zbl 1311.68189
Kao, Mong-Jen; Chen, Han-Lin; Lee, D. T.
9
2015
Iterative partial rounding for vertex cover with hard capacities. Zbl 1411.68196
Kao, Mong-Jen
8
2017
Competitive design and analysis for machine-minimizing job scheduling problem. Zbl 1260.68473
Kao, Mong-Jen; Chen, Jian-Jia; Rutter, Ignaz; Wagner, Dorothea
7
2012
Capacitated domination problem. Zbl 1213.05194
Kao, Mong-Jen; Liao, Chung-Shou; Lee, D. T.
5
2011
Capacitated domination: constant factor approximations for planar graphs. Zbl 1311.68190
Kao, Mong-Jen; Lee, D. T.
2
2011
Approximation algorithms for the capacitated domination problem. Zbl 1288.68270
Kao, Mong-Jen; Chen, Han-Lin
2
2010
Approximation algorithm for vertex cover with multiple covering constraints. Zbl 1518.68266
Hong, Eunpyeong; Kao, Mong-Jen
2
2018
\(O(f)\) bi-approximation for capacitated covering with hard capacities. Zbl 1398.05165
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T.
2
2016
Online dynamic power management with hard real-time guarantees. Zbl 1328.68036
Chen, Jian-Jia; Kao, Mong-Jen; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea
1
2015
Optimal time-convex hull under the \(L _{p }\) metrics. Zbl 1391.68107
Dai, Bang-Sin; Kao, Mong-Jen; Lee, D. T.
1
2013
The density maximization problem in graphs. Zbl 1282.90215
Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea
1
2013
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities. Zbl 1421.68232
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T.
1
2019
Capacitated domination problem. Zbl 1193.05127
Kao, Mong-Jen; Liao, Chung-Shou
1
2007
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities. Zbl 1421.68232
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T.
1
2019
Approximation algorithm for vertex cover with multiple covering constraints. Zbl 1518.68266
Hong, Eunpyeong; Kao, Mong-Jen
2
2018
Iterative partial rounding for vertex cover with hard capacities. Zbl 1411.68196
Kao, Mong-Jen
8
2017
\(O(f)\) bi-approximation for capacitated covering with hard capacities. Zbl 1398.05165
Kao, Mong-Jen; Tu, Hai-Lun; Lee, D. T.
2
2016
Capacitated domination: problem complexity and approximation algorithms. Zbl 1311.68189
Kao, Mong-Jen; Chen, Han-Lin; Lee, D. T.
9
2015
Online dynamic power management with hard real-time guarantees. Zbl 1328.68036
Chen, Jian-Jia; Kao, Mong-Jen; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea
1
2015
Optimal time-convex hull under the \(L _{p }\) metrics. Zbl 1391.68107
Dai, Bang-Sin; Kao, Mong-Jen; Lee, D. T.
1
2013
The density maximization problem in graphs. Zbl 1282.90215
Kao, Mong-Jen; Katz, Bastian; Krug, Marcus; Lee, D. T.; Rutter, Ignaz; Wagner, Dorothea
1
2013
Competitive design and analysis for machine-minimizing job scheduling problem. Zbl 1260.68473
Kao, Mong-Jen; Chen, Jian-Jia; Rutter, Ignaz; Wagner, Dorothea
7
2012
Capacitated domination problem. Zbl 1213.05194
Kao, Mong-Jen; Liao, Chung-Shou; Lee, D. T.
5
2011
Capacitated domination: constant factor approximations for planar graphs. Zbl 1311.68190
Kao, Mong-Jen; Lee, D. T.
2
2011
Approximation algorithms for the capacitated domination problem. Zbl 1288.68270
Kao, Mong-Jen; Chen, Han-Lin
2
2010
Capacitated domination problem. Zbl 1193.05127
Kao, Mong-Jen; Liao, Chung-Shou
1
2007

Citations by Year