This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons.
Author(s): Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi (auth.), John R. Gilbert, Rolf Karlsson (eds.)
Series: Lecture Notes in Computer Science 447
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1990
Language: English
Pages: 417
Tags: Algorithm Analysis and Problem Complexity; Data Structures; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochastic Processes; Statistics, general
Structural complexity theory: Recent surprises....Pages 1-12
Approximating maximum independent sets by excluding subgraphs....Pages 13-25
Generating sparse spanners for weighted graphs....Pages 26-37
Finding the k smallest spanning trees....Pages 38-47
The file distribution problem for processor networks....Pages 48-59
Translating polygons with applications to hidden surface removal....Pages 60-70
Output-sensitive generation of the perspective view of isothetic parallelepipeds....Pages 71-84
Graphics in flatland revisited....Pages 85-96
The visibility diagram: A data structure for visibility problems and motion planning....Pages 97-110
Fast updating of well-balanced trees....Pages 111-121
How to update a balanced binary tree with a constant number of rotations....Pages 122-131
Ranking trees generated by rotations....Pages 132-142
Expected behaviour analysis of AVL trees....Pages 143-159
Analysis of the expected search cost in skip lists....Pages 160-172
Lower bounds for monotonic list labeling....Pages 173-180
Sorting shuffled monotone sequences....Pages 181-191
A faster parallel algorithm for a matrix searching problem....Pages 192-200
A rectilinear steiner minimal tree algorithm for convex point sets....Pages 201-212
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric....Pages 213-224
Input-sensitive compliant motion in the plane....Pages 225-237
Fast algorithms for greedy triangulation....Pages 238-250
Star unfolding of a polytope with applications....Pages 251-263
Space-sweep algorithms for parametric optimization....Pages 264-275
Approximating finite weighted point sets by hyperplanes....Pages 276-286
Data structures for Traveling Salesmen....Pages 287-287
Efficient parallel algorithms for shortest paths in planar graphs....Pages 288-300
The pathwidth and treewidth of cographs....Pages 301-309
Canonical representations of partial 2-and 3-trees....Pages 310-319
On matroids and hierarchical graphs....Pages 320-331
Fast algorithms for two dimensional and multiple pattern matching....Pages 332-347
Boyer-Moore approach to approximate string matching....Pages 348-359
Complete problems with L-samplable distributions....Pages 360-367
Upper envelope onion peeling....Pages 368-379
Applications of a semi-dynamic convex hull algorithm....Pages 380-392
Intersection queries in sets of disks....Pages 393-403
Dynamic partition trees....Pages 404-417
