Titlebook: Algorithms and Data Structures; 6th International Wo Frank Dehne,J?rg-Rüdiger Sack,Roberto Tamassia Conference proceedings 1999 Springer-Ve

beta-carotene

地牢

作嘔

,Ergebnisse und abschlie?ende Bemerkungen,sed on binary trees, we turn our attention to trees of higher degree. We consider both cardinal trees (rooted trees where each node has . positions each of which may have a reference to a child) and ordinal trees (the children of each node are simply ordered). Our representations use a number of bit

concise

Zusammenfassung der wichtigsten Ergebnisse, proportional to the length of the query and the number of occurrences. In the . a set of patterns is preprocessed and subsequent queries of the form: “Find all occurrences of dictionary patterns in text .” are answered in time proportional to the length of the text and the number of occurrences..In

生氣地

Optimization over k-set Polytopes and Efficient k-set Enumeration,e the notion of a .-set polytope and the optimization of a linear function over a .-set polytope. In addition, we obtain several results related to the k-set polytopes. Among others, we show that the 1-skeleton of a .-set polytope restricted to vertices corresponding to the affine .-sets is not always connected.

有害

Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions,kets in two-level hashing schemes. Two memory probes suffice for evaluation of the function. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal.

羽飾

Performance Guarantees for the TSP with a Parameterized Triangle Inequality,me parameter . ≥ 1, the distances satisfy the inequality dist(.) ≤τ. (dist(.)+ dist(.)) for every triple of vertices ., and .. We obtain a 4τ approximation and also show that for some . > 0 it is NP-hard to obtain a (1 + .) approximation. Our upper bound improves upon the earlier known ratio of (3../2/+./2)[.] for all values of . > 7/3.

和藹

Frank Dehne,J?rg-Rüdiger Sack,Roberto TamassiaIncludes supplementary material:

逗留

ostracize