146
click to vote
ESA
15 years 5 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...
106
click to vote
ESA
15 years 5 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...
103
click to vote
ESA
15 years 5 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...
|
Algorithms