ESA
1995
Springer
14 years 4 months ago
1995
Springer
ESA
1995
Springer
14 years 4 months ago
1995
Springer
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...
ESA
1995
Springer
14 years 4 months ago
1995
Springer
ESA
1995
Springer
14 years 4 months ago
1995
Springer
ESA
1995
Springer
14 years 4 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
ESA
1995
Springer
14 years 4 months ago
1995
Springer
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...