Titlebook: Algorithm Theory - SWAT ‘94; 4th Scandianvian Wor Erik M. Schmidt,Sven Skyum Conference proceedings 1994 Springer-Verlag Berlin Heidelberg

地名表

Palter

peritonitis

Computing depth orders and related problems,a set of . convex and simply-shaped objects whose .-projections are all ‘fat’ and their sizes are within a constant ratio from one another, then a depth order for . can be computed in time ...) (.) log..), where . is the maximum number of intersections between the .-projections of the boundaries of any pair of objects in ..

演绎

Selection in monotone matrices and computing ,, nearest neighbors,hbor of .. for every .; . is an appropriate constant. This algorithm is considerably faster than the one based on a row-selection algorithm for monotone matrices. If the points of . are arbitrary, then the .. nearest neighbor of .., for all ., can be computed in time .. log..), which also improves upon the previously best-known result.

medieval

New on-line algorithms for the page replication problem,orm large classes of .-competitive algorithms for trees into 2.-competitive algorithms for rings. As a result we obtain a randomized on-line algorithm for rings that is 3.16-competitive. We also derive two 4-competitive on-line algorithms for rings which are either deterministic or memoryless.

TOM

Inelasticity

Separating translates in the plane: Combinatorial bounds and an algorithm,y orientation . (f is defined only by the “shape” of the translate). We also present an . log (.) time algorithm for finding a translate which can be separated from the maximum number of translates amongst sets of . pairwise disjoint translates of convex .-gons.

军械库

不幸的人

Matrimony

Conference proceedings 1994Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases.