E-LIB Suche - Ergebnisse für: Kao, Mong-Jen

1

Near-Optimal UAV Deployment for Delay-Bounded Data Collecti..:

, In: IEEE INFOCOM 2024 - IEEE Conference on Computer Communications,

Chang, Shu-Wei ; Kuo, Jian-Jhih ; Kao, Mong-Jen.. - p. 111-120 , 2024

Link: https://doi.org/10.1109/..

2

Approximation Algorithm for Vertex Cover with Multiple Cove..:

Hung, Eunpyeong ; Kao, Mong-Jen
Algorithmica. 84 (2021) 1 - p. 1-12 , 2021

Link: https://doi.org/10.1007/..

3

A Survey on Capacitated Covering and Related Problems:

, In: 2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN),

Kao, Mong-Jen - p. 266-272 , 2020

Link: https://doi.org/10.1109/..

4

Iterative Partial Rounding for Vertex Cover with Hard Capac..:

Kao, Mong-Jen
Algorithmica. 83 (2020) 1 - p. 45-71 , 2020

Link: https://doi.org/10.1007/..

5

The Multi-service Location Problems:

, In: Communications in Computer and Information Science; New Trends in Computer Technologies and Applications,

Yu, Hung-I ; Kao, Mong-Jen ; Lee, D. T. - p. 507-515 , 2019

Link: https://doi.org/10.1007/..

6

Tight approximation for partial vertex cover with hard capa..:

Kao, Mong-Jen ; Shiau, Jia-Yau ; Lin, Ching-Chi.
Theoretical Computer Science. 778 (2019) - p. 61-72 , 2019

Link: https://doi.org/10.1016/..

7

An O(f) Bi-approximation for Weighted Capacitated Covering ..:

, In: Communications in Computer and Information Science; New Trends in Computer Technologies and Applications,

Tu, Hai-Lun ; Kao, Mong-Jen ; Lee, D. T. - p. 468-475 , 2019

Link: https://doi.org/10.1007/..

8

O(f) Bi-criteria Approximation for Capacitated Covering wit..:

Kao, Mong-Jen ; Tu, Hai-Lun ; Lee, D. T.
Algorithmica. 81 (2018) 5 - p. 1800-1817 , 2018

Link: https://doi.org/10.1007/..

9

Iterative partial rounding for vertex cover with hard capac..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,

Kao, Mong-Jen - p. 2638-2653 , 2017

Link: https://dl.acm.org/doi/1..

10

Optimal time-convex hull for a straight-line highway in L-m..:

Dai, Bang-Sin ; Kao, Mong-Jen ; Lee, D.T.
Computational Geometry. 53 (2016) - p. 1-20 , 2016

Link: https://doi.org/10.1016/..

11

Online dynamic power management with hard real-time guarant..:

Chen, Jian-Jia ; Kao, Mong-Jen ; Lee, D.T...
Theoretical Computer Science. 595 (2015) - p. 46-64 , 2015

Link: https://doi.org/10.1016/..

12

Capacitated Domination: Problem Complexity and Approximatio..:

Kao, Mong-Jen ; Chen, Han-Lin ; Lee, D. T.
Algorithmica. 72 (2013) 1 - p. 1-43 , 2013

Link: https://doi.org/10.1007/..

13

The density maximization problem in graphs:

Kao, Mong-Jen ; Katz, Bastian ; Krug, Marcus...
Journal of Combinatorial Optimization. 26 (2012) 4 - p. 723-754 , 2012

Link: https://doi.org/10.1007/..

14

Capacitated Domination Problem:

Kao, Mong-Jen ; Liao, Chung-Shou ; Lee, D. T.
Algorithmica. 60 (2009) 2 - p. 274-300 , 2009

Link: https://doi.org/10.1007/..

15

Improved Approximation Algorithm for Capacitated Facility L..:

Kao, Mong-Jen
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023). , 2023

Link: https://doi.org/10.4230/..