Given a weighted, ordered query set Q and a partition of Q into classes,...
It is natural to generalize the k-Server problem by allowing each reques...
We present a simple O(n^4)-time algorithm for computing optimal search
t...
Search trees are commonly used to implement access operations to a set o...
Data-structure dynamization is a general approach for making static data...
We study the problem of selecting control clones in DNA array hybridizat...
This paper gives poly-logarithmic-round, distributed D-approximation
alg...
Huang and Wong [5] proposed a polynomial-time dynamic-programming algori...