第 1 到 5 筆結果,共 5 筆。
公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 2015 | Capacitated Domination: Problem Complexity and Approximation Algorithms | Mong-Jen Kao; Han-Lin Chen; D.T. Lee | Algorithmica 72(1), 1-43 | |||
2 | 2019 | O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities(AACT 2019 Best Journal Paper Award) | Mong-Jen Kao; Hai-Lun Tu; D.T. Lee | Algorithmica 81, 1800-1817 | |||
3 | 2015 | Online Dynamic Power Management with Hard Real-Time Guarantees | Jian-Jia Chen; Mong-Jen Kao; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Theoretical Comput. Sci. 595, 46-64 | |||
4 | 2016 | Optimal Time-Convex Hull for a Straight-Line Highway in Lp-Metrics | B.-S. Dai; Mong-Jen Kao; D.T. Lee | Computational Geometry: Theory and Applications 53, 1-20 | |||
5 | 2013 | The Density Maximization Problem in Graphs | Mong-Jen Kao; Bastian Katz; Marcus Krug; D.T. Lee ; Ignaz Rutter; Dorothea Wagner | Journal of Combinatorial Optimization 26(4), 723-754 |