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

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

Hello! Ria Christie Collections is an online venture that was initially set up in 2012 to sell books. We do not have a physical high street store. We are professional online booksellers. We only sell brand new books in perfect condition that we source from various suppliers and the publishers. Primarily, our aim is to provide an excellent service to all our customers. We always work as a team to achieve this. Our other objectives are to: 1. Ensure that all our products reach their destination quickly in a safe and secure manner 2. Answer to all our customer queries within 24 hours 3. Ensure that our customers are happy with their purchases 4. Provide all the items at a competitive price 5. Always listen to our customers Ria Christie Collections is not a registered company. It is a Sole Trader venture. Other key information is shown below: Contact Person Name: Rakesh Luchmun (Mr) Storefront Name: Ria Christie Collections Place of Establishment Address: Suite B; ARUN House; ARUN Building Arundel Road Uxbridge UB8 2RR United Kingdom E-Mail Address: riachristie@hotmail.co.uk VAT Number: GB 160 5650 25 We always work hard and aim to comply with all of Abebooks Policies. If you have any issues, please do not hesitate to write to us whether before or after a purchase. We promise to reply to you promptly and, in any case, within 24 hours. Thank you kindly! Yours sincerely Mr Rakesh Luchmun (Founder) and the Ria Christie Collections Team

Visita la pagina della libreria

Informazioni sull?azienda del venditore

Ryefield Investments Limited
175 Pield Heath Road, Uxbridge, UB8 3NL, United Kingdom

Condizioni di vendita e spedizione

Condizioni di vendita

All Returns and Refund are as per Abebooks policies.

Diritto di recesso

Condizioni di spedizione

Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!

Tariffe di spedizione da Regno Unito a Italia

Tariffe di spedizione da Regno Unito a Italia
Quantit� dell?ordine	Da 5 a 10 giorni lavorativi	Da 5 a 9 giorni lavorativi
Primo articolo	EUR 10.31	EUR 10.31

I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.