• Home
  • Algorithms
  • Algorithms — ESA 2001: 9th Annual European Symposium Århus, by Lars Arge (auth.), Friedhelm Meyer auf der Heide (eds.)

Algorithms — ESA 2001: 9th Annual European Symposium Århus, by Lars Arge (auth.), Friedhelm Meyer auf der Heide (eds.)

By Lars Arge (auth.), Friedhelm Meyer auf der Heide (eds.)

This booklet constitutes the refereed court cases of the ninth Annual eu Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001.
The forty-one revised complete papers provided including 3 invited contributions have been conscientiously reviewed and chosen from 102 submissions. The papers are prepared in topical sections on caching and prefetching, on-line algorithms, information buildings, optimization and approximation, sequences, scheduling, shortest paths, geometry, allotted algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.

Show description

Read Online or Download Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings PDF

Similar algorithms books

Computability and Complexity Theory

This quantity introduces fabrics which are the middle wisdom within the idea of computation. The booklet is self-contained, with a initial bankruptcy describing key mathematical options and notations and next chapters relocating from the qualitative points of classical computability conception to the quantitative features of complexity concept.

Algorithms and Data Structures in VLSI Design: OBDD — Foundations and Applications

One of many major difficulties in chip layout is the massive variety of attainable combos of person chip parts, resulting in a combinatorial explosion as chips turn into extra advanced. New key leads to theoretical desktop technology and within the layout of knowledge buildings and effective algorithms could be utilized fruitfully the following.

A Collection of Bit Programming Interview Questions solved in C++

Bits is the second one of a chain of 25 Chapters dedicated to algorithms, challenge fixing, and C++ programming. This ebook is set low point bit programming

Algorithmic Mathematics

Algorithms play an more and more vital function in approximately all fields of arithmetic. This booklet permits readers to strengthen easy mathematical skills, particularly these about the layout and research of algorithms in addition to their implementation. It offers not just primary algorithms just like the sieve of Eratosthenes, the Euclidean set of rules, sorting algorithms, algorithms on graphs, and Gaussian removing, but additionally discusses simple facts constructions, uncomplicated graph idea, and numerical questions.

Extra resources for Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

Sample text

P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Indexing for data models with constraints and classes. Journal of Computer and System Sciences, 52(3):589–612, 1996. 102. K. V. R. Kanth and A. K. Singh. Optimal dynamic range searching in nonreplicating index structures. In Proc. International Conference on Database Theory, LNCS 1540, pages 257–276, 1999. 103. N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest-neighbor queries. In Proc. SIGMOD Intl.

Kriegel. The buddy-tree: An efficient and robust access method for spatial data base systems. In Proc. International Conf. on Very Large Databases, pages 590–601, 1990. 139. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+ -tree: A dynamic index for multi-dimensional objects. In Proc. International Conf. on Very Large Databases, pages 507–518, 1987. 140. J. Snoeyink. Point location. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 30, pages 559–574.

On R-trees with low stabbing number. In Proc. Annual European Symposium on Algorithms, pages 167–178, 2000. 69. D. J. DeWitt, N. Kabra, J. Luo, J. M. -B. Yu. Client-server paradise. In Proc. International Conf. on Very Large Databases, pages 558–569, 1994. 70. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86–124, 1989. 71. H. Edelsbrunner. A new approach to rectangle intersections, part I. Int. J. Computer Mathematics, 13:209–219, 1983.

Download PDF sample

Rated 4.83 of 5 – based on 19 votes