1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
Yi-Ting Hsieh, Mong-Jen Kao, Jhong-Yun Liu +1
We are concerned with the problem of scheduling jobs onto identical machines. Each machine has to be in operation for a prescribed time, and the objective is to minimize th…
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
Hyung-Chan An, Mong-Jen Kao, Changyeol Lee +1
We consider the classic correlation clustering problem in the hierarchical setting. Given a complete graph and layers of input information, where the input of each…
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…