8 citations · 12 across the 9 of their papers we have counts for
4 papers · 1 filter
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter +1
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival…
Optimal Time-Convex Hull under the Lp Metrics
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
We consider the problem of computing the time-convex hull of a point set under the general metric in the presence of a straight-line highway in the plane. The traveling speed…
Online Power-Managing Strategy with Hard Real-Time Guarantees
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee +2
We consider the problem of online dynamic power management that provides hard real-time guarantees. In this problem, each of the given jobs is associated with an arrival time, a de…
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embed…