+612 9045 4394
 
CHECKOUT
Algorithms and Data Structures : 5th International Workshop, Wads '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings - Frank Dehne

Algorithms and Data Structures

5th International Workshop, Wads '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings

By: Frank Dehne (Editor), A. Rau-Chaplin (Editor), J. R. Sack (Editor), Roberto Tamassia (Editor)

Paperback Published: 23rd July 1997
ISBN: 9783540633075
Number Of Pages: 481

Share This Book:

Paperback

$169.73
or 4 easy payments of $42.43 with Learn more
Ships in 5 to 9 business days

Other Available Editions (Hide)

  • Paperback View Product Published: 25th July 2001
    Ships in 5 to 9 business days
    $147.02
  • Paperback View Product Published: 15th July 2013
    Ships in 5 to 9 business days
    $147.02
  • Paperback View Product Published: 28th July 1993
    Ships in 5 to 9 business days
    $181.29
  • Paperback View Product Published: 16th July 2003
    Ships in 5 to 9 business days
    $158.39
  • Paperback View Product Published: 15th July 2015
    Ships in 5 to 9 business days
    $147.02
  • Paperback View Product Published: 4th August 2005
    Ships in 5 to 9 business days
    $158.39
  • Paperback View Product Published: 1st November 2011
    $224.90
  • Paperback View Product Published: 30th July 2007
    Ships in 5 to 9 business days
    $204.16
  • Paperback View Product Published: 1st September 2009
    Ships in 5 to 9 business days
    $181.29
  • Paperback View Product Published: 21st July 1999
    Ships in 5 to 9 business days
    $135.51
  • Paperback View Product Published: 24th July 1991
    Ships in 5 to 9 business days
    $169.73
  • Paperback View Product Published: 2nd August 1989
    Ships in 5 to 9 business days
    $135.51

This book constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Data Structures, WADS'97, held in Nova Scotia, Halifax, Canada, in August 1997.
The 37 revised full papers presented were carefully selected from a total of 81 submissions. Also included are four abstracts and one full contribution corresponding to the invited talks. Among the topics covered are data structures and algorithmic aspects in a variety of areas like computational geometry, graph theory, networking, load balancing, optimization, approximation, sorting, pattern matching, etc.

Discrepancy theory and computational geometry.- Dynamic motion planning in low obstacle density environments.- Visibility-based pursuit-evasion in a polygonal environment.- Maintaining the extent of a moving point set.- Finding cores of limited length.- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem.- Approximation algorithms for a genetic diagnostics problem.- Cartographic line simplication and polygon CSG formulae in O(n log* n) time.- Constrained TSP and low-power computing.- On-line load balancing for related machines.- A linear-time algorithm for the 1-mismatch problem.- On some geometric optimization problems in layered manufacturing.- New TSP construction heuristics and their relationships to the 2-opt.- Pattern matching in hypertext.- Multiple approximate string matching.- Applied computational geometry - Abstract.- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract).- Voronoi diagrams for polygon-offset distance functions.- Randomized algorithms for that ancient scheduling problem.- Optimal parallel algorithms for proximate points, with applications.- An efficient algorithm for shortest paths in vertical and horizontal segments.- On geometric path query problems.- On-line scheduling with hard deadlines.- Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access.- Parallel vs. parametric complexity.- Position-independent near optimal searching and on-line recognition in star polygons.- Dynamic data structures for fat objects and their applications.- Intractability of assembly sequencing: Unit disks in the plane.- On hamiltonian triangulations in simple polygons (Extended Abstract).- Computing orthogonal drawings with the minimum number of bends.- On a simple depth-first search strategy for exploring unknown graphs.- Orthogonal drawing of high degree graphs with small area and few bends.- A centroid labelling technique and its application to path selection in trees.- Offset-polygon annulus placement problems.- Computing constrained minimum-width annuli of point sets.- Geometric Applications of Posets.- Constructing pairwise disjoint paths with few links.- Trans-dichotomous algorithms without multiplication - some upper and lower bounds.- An approximation algorithm for stacking up bins from a conveyer onto pallets.- Relaxed balance through standard rotations.- Efficient breakout routing in printed circuit boards.- Planarity, revisited (extended abstract).

ISBN: 9783540633075
ISBN-10: 3540633073
Series: Eso Astrophysics Symposia
Audience: General
Format: Paperback
Language: English
Number Of Pages: 481
Published: 23rd July 1997
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.52
Weight (kg): 0.68