Titlebook: Algorithms and Computation; 7th International Sy Tetsuo Asano,Yoshihide Igarashi,Subhash Suri Conference proceedings 1996 Springer-Verlag B

Cabg318

Computing fair and bottleneck matchings in geometric graphs,tching problem in higher dimensions. We extend the planar results of Chang et al. [4] and Su and Chang [22], and show that given a set . of 2. points in .-space, it is possible to compute a bottleneck matching of . in roughly .(..) time, for .≤6, and in sub quadratic time, for .>6.

Defiance

thalamus

W. Overbeck (Ehem. Direktor),W. Franzcomplexity of both problems on all interesting special classes of trees. We also present the first approximation algorithm with non-trivial approximation ratios. In particular, we achieve a ratio of log.., where . is the number of vertices in the trees.

破布

FLINT

farewell

Distribution

Interval finding and its application to data mining,ction is either . or ., and the conditional functions are additive, where a function . is additive . extending a function . on ., and quotient if it is represented as a quotient of two additive functions. We use computational-geometric methods such as convex hull, range searching, and multidimensional divide-and-conquer.

陳舊

誘拐

Two-dimensional dynamic dictionary matching,rison with the previously best scheme [AFI.93] (which is non-suffix-tree based), our new solution can perform an update more efficiently, without trading the searching time bound. Our work also gives a clue to improve the solution to the static dictionary matching problem [AF92].

健談