Titlebook: Algorithms - ESA 2003; 11th Annual European Giuseppe Battista,Uri Zwick Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003

你敢命令

Sublinear Computingt results in property testing, streaming, and sublinear approximation algorithms have shown that, for a large class of problems, all but a vanishing fraction of the input data is essentially unnecessary. While grounding the discussion on a few specific examples, I will review some of the basic princ

拾落穗

LURE

gratify

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queriesven a set of . weighted points in ℝ., the range-max problem asks for the maximum-weight point in a query hyper-rectangle. In the dual stabbing-max problem, we are given . weighted hyper-rectangles, and we wish to find the maximum-weight rectangle containing a query point. Our structures improve on p

Lumbar-Stenosis

Line System Design and a Generalized Coloring Problemlem we are interested in finding a coloring and routing of “demands” of minimum total cost where the total cost is obtained by accumulating the cost incurred at certain “links” in the graph. The colors are partitioned in sets and the sets themselves are ordered so that colors in higher sets cost mor