Titlebook: Algorithms and Computation; 11th International C Gerhard Goos,Juris Hartmanis,Shang-Hua Teng Conference proceedings 2000 Springer-Verlag Be

流浪

https://doi.org/10.1007/978-3-662-26421-8We generalize the construction of Gabber and Galil to essentially every unimodular matrix in ..(.). It is shown that every parabolic or hyperbolic fractional linear transformation explicitly defines an expander of bounded degree and constant expansion. Thus all but a vanishingly small fraction of unimodular matrices define expanders.

macrophage

hidebound

deforestation

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial CircuitsThe maximum power consumption problem on combinatorial circuits is the problem of estimating the maximum power consumption of a given combinatorial circuit. It is easy to see that this problem for general circuits is hard to approximate within a factor of ..

GLIDE

Voronoi-Based Systems of Coordinates and Surface ReconstructionSibson in 1980. It is defined geometrically from the Voronoi diagram of the points and has nice properties that make it suitable for scattered data interpolation. Since then, other systems of coordinates have been proposed, resulting in new theoretical insights and new applications. The case where t

condemn

Strategies for Hotlink Assignmentsdesignated source page, represented by a source node . of .. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are interested in minimizing the expected number of steps needed to visit a selected set of web pages fro

Overdose

A New Competitive Analysis of Randomized Caching . α of the sequence of memory references, which is the highest possible hit rate that any algorithm can achieve on the sequence for a cache of a given size. Our results show that . is (1-αe.)/(1-α)-competitive on any reference sequence with inherent hit rate α. Since our new competitive bound does

嘲弄

Online Routing in Convex Subdivisionsry triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm

promote

A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors the problem has made significant progress recently, which, however, seems not to imply practical algorithms for the problem, yet. Practical algorithms have been developed only for systems with three processors and the techniques seem dificult to extend to systems with more than three processors. Th

Panacea