Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings (Lecture Notes in Computer Science)

Dehne, Frank [Editor]; Santoro, Nicola [Editor]; Sack, Jörg-Rüdiger [Editor];

ISBN 10: 3540543430 / ISBN 13: 9783540543435

Editore: Springer, 1991

Riguardo questo articolo

Ex-library paperback in very nice condition with the usual markings and attachments.Except for library markings, interior clean and unmarked. Tight binding.

Codice articolo UTD14a-0952

Dati bibliografici

• Titolo: Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings (Lecture Notes in Computer Science)
• Editore: Springer
• Data di pubblicazione: 1991
• Lingua: Inglese
• ISBN 10: 3540543430
• ISBN 13: 9783540543435
• Rilegatura: Paperback
• Condizione: Very Good
• Peso: 56 once

Descrizione articolo

Riassunto

This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations.

Contenuti

A case study in comparison based complexity: Finding the nearest value(s).- On the zone of a surface in a hyperplane arrangement.- Ray-shooting and isotopy classes of lines in 3-dimensional space.- Finding level-ancestors in dynamic trees.- Treewidth of circular-arc graphs+.- Fully dynamic delaunay triangulation in logarithmic expected time per operation.- On computing the voronoi diagram for restricted planar figures.- The MINSUMCUT problem.- Efficient algorithms for the minimum range cut problems.- Memory access in models of parallel computation: From folklore to synergy and beyond.- Farthest neighbors, maximum spanning trees and related problems in higher dimensions.- Shallow interdistance selection and interdistance enumeration.- Sharing memory in asynchronous message passing systems.- A linear-time scheme for version reconstruction.- The interval skip list: A data structure for finding all intervals that overlap a point.- Geometric knapsack problems.- A fast derandomization scheme and its applications.- Unstructured path problems and the making of semirings.- Neighborhood graphs and geometric embedding.- Finding optimal bipartitions of points and polygons.- Immobilizing a polytope.- What can we learn about suffix trees from independent tries?.- Competitive algorithms for the weighted list update problem.- An optimal algorithm for the rectilinear link center of a rectilinear polygon.- Geometric searching and link distance.- Representing and enumerating edge connectivity cuts in RNC.- Planar graph augmentation problems.- Parametric search and locating supply centers in trees.- On bends and lengths of rectilinear paths: A graph-theoretic approach.- Computing minimum length paths of a given homotopy class.- Approximation algorithms for selecting network centers.- Facility dispersion problems: Heuristics and special cases.- Optimum guard covers and m-watchmen routes for restricted polygons.- Applications of a new space partitioning technique.- Offline algorithms for dynamic minimum spanning tree problems.- An empirical analysis of algorithms for constructing a minimum spanning tree.- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible.- Dynamically maintaining the visibility graph.- An optimal algorithm for computing visibility in the plane.- Fully persistent data structures for disjoint set union problems.- Algorithms for generating all spanning trees of undirected, directed and weighted graphs.- Sorting multisets and vectors in-place.- Probabilistic leader election on rings of known size.