K. Chao

most citedMinkowski Sum Selection and Finding

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2008

Algorithms for Locating Constrained Optimal Intervals

Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao

In this work, we obtain the following new results. 1. Given a sequence $D = ((h_{1}, s_{1}), (h_{2}, s_{2}) ..., (h_{n}, s_{n}))$ of number pairs, where $s_{i} > 0$ for all $i$ , and a number $L_{h}$ , we…

cs.DS2008★ 1 cited

Minkowski Sum Selection and Finding

Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen +1

For the \textsc{Minkowski Sum Selection} problem with linear objective functions, we obtain the following results: (1) optimal $O (n lo g n)$ time algorithms for $λ = 1$ ; (2) $O(n\log^…

cs.GT2008

An $O ~ (n^{2.5})$ -Time Algorithm for Online Topological Ordering

Hsiao-Fei Liu, Kun-Mao Chao

We present an $O ~ (n^{2.5})$ -time algorithm for maintaining the topological order of a directed acyclic graph with $n$ vertices while inserting $m$ edges.

Algorithms for Locating Constrained Optimal Intervals

Minkowski Sum Selection and Finding

An O~(n2.5)-Time Algorithm for Online Topological Ordering

An $O ~ (n^{2.5})$ -Time Algorithm for Online Topological Ordering