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 e-book 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 offered including 3 invited contributions have been rigorously reviewed and chosen from 102 submissions. The papers are geared up in topical sections on caching and prefetching, on-line algorithms, facts 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 or Download Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings PDF

Similar algorithms books

A History of Algorithms: From the Pebble to the Microchip

Amazon hyperlink: http://www. amazon. com/History-Algorithms-From-Pebble-Microchip/dp/3540633693

The improvement of computing has reawakened curiosity in algorithms. usually missed through historians and sleek scientists, algorithmic tactics were instrumental within the improvement of primary rules: perform resulted in idea simply up to the opposite direction around. the aim of this publication is to supply a old heritage to modern algorithmic perform.

Algorithms and Data Structures for External Memory (Foundations and Trends(R) in Theoretical Computer Science)

Info units in huge functions are frequently too mammoth to slot thoroughly contained in the computer's inner reminiscence. The ensuing input/output verbal exchange (or I/O) among quick inner reminiscence and slower exterior reminiscence (such as disks) could be a significant functionality bottleneck. Algorithms and information constructions for exterior reminiscence surveys the state-of-the-art within the layout and research of exterior reminiscence (or EM) algorithms and information constructions, the place the aim is to take advantage of locality and parallelism so one can lessen the I/O charges.

Nonlinear Assignment Problems: Algorithms and Applications

Nonlinear task difficulties (NAPs) are common extensions of the vintage Linear project challenge, and regardless of the efforts of many researchers over the last 3 a long time, they nonetheless stay the various toughest combinatorial optimization difficulties to resolve precisely. the aim of this booklet is to supply in one quantity, significant algorithmic points and purposes of NAPs as contributed via top foreign specialists.

Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings

This booklet constitutes the revised chosen papers of the eighth overseas Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014. The 29 complete papers awarded including three invited talks have been rigorously reviewed and chosen from sixty two submissions. The papers are equipped in topical sections on computational geometry, algorithms and approximations, dispensed computing and networks, graph algorithms, complexity and boundaries, and graph embeddings and drawings.

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

Example text

On Management of Data, pages 47–57, 1984. 93. J. M. Hellerstein, E. Koutsoupias, and C. H. Papadimitriou. On the analysis of indexing schemes. In Proc. ACM Symp. Principles of Database Systems, pages 249–256, 1997. 94. K. H. Hinrichs. The grid file system: Implementation and case studies of applications. PhD thesis, Dept. Information Science, ETH, Z¨ urich, 1985. 95. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157–184, 1982. 96. D. Hutchinson, A.

101. 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.

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. CRC Press LLC, Boca Raton, FL, 1997.

Download PDF sample

Rated 4.19 of 5 – based on 42 votes