+612 9045 4394
 
CHECKOUT
Swat '90 : 2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings - John R. Gilbert

Swat '90

2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings

By: John R. Gilbert (Editor), Rolf Karlsson (Editor)

Paperback

Published: 2nd July 1990
Ships: 15 business days
15 business days
$135.51
or 4 easy payments of $33.88 with Learn more

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.

Structural complexity theory: Recent surprises.- Approximating maximum independent sets by excluding subgraphs.- Generating sparse spanners for weighted graphs.- Finding the k smallest spanning trees.- The file distribution problem for processor networks.- Translating polygons with applications to hidden surface removal.- Output-sensitive generation of the perspective view of isothetic parallelepipeds.- Graphics in flatland revisited.- The visibility diagram: A data structure for visibility problems and motion planning.- Fast updating of well-balanced trees.- How to update a balanced binary tree with a constant number of rotations.- Ranking trees generated by rotations.- Expected behaviour analysis of AVL trees.- Analysis of the expected search cost in skip lists.- Lower bounds for monotonic list labeling.- Sorting shuffled monotone sequences.- A faster parallel algorithm for a matrix searching problem.- A rectilinear steiner minimal tree algorithm for convex point sets.- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric.- Input-sensitive compliant motion in the plane.- Fast algorithms for greedy triangulation.- Star unfolding of a polytope with applications.- Space-sweep algorithms for parametric optimization.- Approximating finite weighted point sets by hyperplanes.- Data structures for Traveling Salesmen.- Efficient parallel algorithms for shortest paths in planar graphs.- The pathwidth and treewidth of cographs.- Canonical representations of partial 2-and 3-trees.- On matroids and hierarchical graphs.- Fast algorithms for two dimensional and multiple pattern matching.- Boyer-Moore approach to approximate string matching.- Complete problems with L-samplable distributions.- Upper envelope onion peeling.- Applications of a semi-dynamic convex hull algorithm.- Intersection queries in sets of disks.- Dynamic partition trees.

ISBN: 9783540528463
ISBN-10: 3540528466
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 417
Published: 2nd July 1990
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.24
Weight (kg): 0.6