Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be

incubus

https://doi.org/10.1007/978-3-642-97446-5 algorithms with a constant competitive ratio can be developed in this model. We also study distributed paging. We examine the . of this problem in which there exists only one copy of each page. We develop efficient deterministic and randomized on-line algorithms for this problem.

laxative

咆哮

https://doi.org/10.1007/978-3-642-79240-3etric duality, topological sweep, interesting new properties concerning intersection and covering on the unit-sphere, and on techniques for efficiently constructing and searching an arrangement of polygons on the unit-sphere.

Evolve

ordain

https://doi.org/10.1007/978-3-658-01451-3and robotics..After proving a ≈ 1.64 lower bound on the competitive ratio that can be achieved by on-line algorithms for OLTSP, two competitive algorithms are shown, one of which is 2-competitive and works for any metric space. The second one allows to achieve a nearly optimal competitive ratio of 1.75 on the real line.

kindred

彎彎曲曲

Balanced distributed search trees do not exist,c upper bound cannot be achieved. This is true although each node is allowed to have arbitrary degree (note that in this case, the height of a single site search tree is trivially bounded by one). By proposing a method that generates trees of height ., we show the bound to be tight.