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

種類:

電子ブック

責任表示:

edited by Jan van Leeuwen

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1994

著者名:

• Leeuwen, Jan van.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 855

ISBN:

9783540487944 [3540487948]    

注記:

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

ローカル注記:

学内専用E-BOOKS (local access only)