Algorithms - ESA '94: Second Annual European Symposium, Utrecht, The Netherlands, September 26 - 28, 1994. Proceedings

Cover
Jan Leeuwen, Jan van Leeuwen
Springer Science & Business Media, 14.09.1994 - 510 Seiten
This volume presents the proceedings of the Second Annual European Symposium on Algorithms (ESA '94), held near Utrecht, The Netherlands in September 1994. ESA is the premier European conference on algorithms.
The 42 papers presented were selected from a total of 159 submissions and reflect many of the current directions in algorithm research. The volume is organized into chapters on automatic graph drawing and rendering, spanners and Steiner trees, efficient data structures and complexity analysis, graph algorithms, distributed algorithms, computational geometry and its applications, operations research and combinatorial optimization, parallel computation and interconnection networks, complexity theory, and text processing
 

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.

Inhalt

Invited Lectures
1
A Better Heuristic for Orthogonal Graph Drawings
24
Spanners and Steiner Trees
48
Efficient Datastructures and Complexity Analysis
72
The Analysis of a Hashing Scheme by the Diagonal Poisson Transform
94
Graph Algorithms I
118
EdgeDisjoint s Paths in Undirected Planar Graphs in Linear Time
130
Approximation Algorithm on MultiWay Maxcut Partitioning
148
Operations Research and Combinatorial Optimization
290
Tight Approximations for Resource Constrained Scheduling Problems
307
Graph Algorithms II
331
Finding and Counting Given Length Cycles
354
Desnakification of Mesh Sorting Algorithms
377
Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy
391
An Area Lower Bound for a Class of FatTrees
413
Problems for Geometric Graphs
434

Distributed Algorithms
171
OnLine Distributed Data Management
202
Computational Geometry
215
Range Searching and Point Location among Fat Objects
240
Computational Geometry and Robotics
254
Fast Algorithms for Collision and Proximity Problems Involving
278
The Parallel Complexity of Eden Growth SolidonSolid Growth and
436
Text Processing Algorithms
460
On the Exact Complexity of the String PrefixMatching Problem
483
Erratum to the ESA 93 Proceedings
508
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Beliebte Passagen

Seite 423 - Yang, and R. Zak. The network architecture of the Connection Machine CM-5. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 272-285, July 1992.

Bibliografische Informationen