Del 519 - Lecture Notes in Computer Science

Algorithms and Data Structures

2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings

Häftad, Engelska, 1991

Av Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1991-07-24
Mått155 x 233 x 28 mm
Vikt768 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor502
Upplaga1991
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540543435

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Matematisk statistik inom Naturvetenskap och teknik
Tillämpad matematik inom Naturvetenskap och teknik
Databaser inom Data och it

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.