Mong-jen Kao - Citegraph

Author Info

Name	Affiliation	Papers
MONG-JEN KAO	Department of Computer Science and Information Engineering, National Taiwan University, Taipei Taiwan	21
Collaborators	Citations	PageRank
19	26	7.82
Referers	Referees	References
46	321	239

Search Limit

100321

Publications (21 rows)

Collaborators (19 rows)

Referers (46 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Tight approximation for partial vertex cover with hard capacities.	0	0.34	2019
O( f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities	0	0.34	2019
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.	0	0.34	2018
The Multi-service Location Problems.	0	0.34	2018
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity.	0	0.34	2018
Tight Approximation for Partial Vertex Cover with Hard Capacities.	0	0.34	2017
Optimal time-convex hull for a straight-line highway in Lp-metrics.	0	0.34	2016
Iterative partial rounding for vertex cover with hard capacities	1	0.37	2016
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.	0	0.34	2016
Capacitated Domination: Problem Complexity and Approximation Algorithms	4	0.48	2015
Online Dynamic Power Management with Hard Real-Time Guarantees.	5	0.47	2014
Optimal time-convex hull under the Lp metrics	0	0.34	2013
Online Power-Managing Strategy with Hard Real-Time Guarantees	0	0.34	2013
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch	1	0.36	2013
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.	4	0.51	2012
Connecting Two Trees with Optimal Routing Cost.	0	0.34	2011
Capacitated domination: constant factor approximations for planar graphs	3	0.40	2011
The density maximization problem in graphs	0	0.34	2011
Capacitated Domination Problem	4	0.42	2011
Approximation algorithms for the capacitated domination problem	1	0.36	2010
Capacitated Domination Problem	3	0.38	2007