ESA
2004
Springer
14 years 5 months ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
ESA
2004
Springer
14 years 5 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
ESA
2004
Springer
14 years 5 months ago
2004
Springer
In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new dema...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
