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

Keywords

Bibliographic Information

Book Title: Algorithms - ESA '94
Book Subtitle: Second Annual European Symposium, Utrecht, The Netherlands, September 26 - 28, 1994. Proceedings
Editors: Jan Leeuwen
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0049390
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1994
Softcover ISBN: 978-3-540-58434-6Published: 14 September 1994
eBook ISBN: 978-3-540-48794-4Published: 11 April 2006
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 522
Topics: Theory of Computation, Software Engineering/Programming and Operating Systems, Algorithm Analysis and Problem Complexity, Combinatorics, Numerical Analysis, Computer Graphics

Publish with us

Policies and ethics

Algorithms - ESA '94

Editors:

Sections

Buy it now

Other ways to access

Table of contents (45 papers)

Front Matter

Optimization algorithms for large networks

Wanna buy an algorithm? Cheap! or: Algorithms for text searching which could have commercial value

Planar drawings and angular resolution: Algorithms and bounds

A better heuristic for orthogonal graph drawings

Hamiltonian triangulations for fast rendering

Efficient construction of a bounded degree spanner with low weight

Approaching the 5/4 — approximation for rectilinear Steiner trees

Membership in constant time and minimum space

Faster searching in tries and quadtrees—An analysis of level compression

The analysis of a hashing scheme by the diagonal poisson transform

Some lower bounds for comparison-based algorithms

An efficient algorithm for edge-ranking trees

Edge-disjoint (s, t)-paths in undirected planar graphs in linear time

A simple min cut algorithm

Approximation algorithm on multi-way maxcut partitioning

A linear-time algorithm for finding a central vertex of a chordal graph

The time complexity of updating snapshot memories

Non-exploratory self-stabilization for constant-space symmetry-breaking

On-line distributed data management

Other Volumes