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

Admire

Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensionsrticular, we prove a tight upper bound of .(..) for the vertical decomposition of an arrangement of . hyperplanes in four dimensions, improving the best previously known bound [.] by a logarithmic factor. We also show that the complexity of the vertical decomposition of an arrangement of . 3-simplic

CORE

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensionsall . pairs of indices (.) such that .. intersects ... For the planar case we describe a simple algorithm with running time .(..log. + .), and an improved randomized algorithm with expected running time .((. log . + .)α(.)log.) (which is faster for small values of .). For . = 3, we present an .(.. +

AVID

IVORY

Inferior

Admission Control to Minimize Rejectionsls that arrive over time, accepting some and rejecting others in order to stay within capacity limitations of the network. In the standard theoretical formulation, this problem is analyzed as a benefit problem: the goal is to devise an online algorithm that accepts at least a reasonable fraction of