000 05741nam a22006735i 4500
001 978-3-540-69422-9
003 DE-He213
005 20240423132450.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540694229
_9978-3-540-69422-9
024 7 _a10.1007/3-540-63307-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithms and Data Structures
_h[electronic resource] :
_b5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings /
_cedited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aXI, 481 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1272
505 0 _aDiscrepancy 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 minimumnumber 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).
520 _aThis 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.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer graphics.
650 1 4 _aTheory of Computation.
650 2 4 _aProgramming Techniques.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
700 1 _aDehne, Frank.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRau-Chaplin, Andrew.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSack, Jörg-Rüdiger.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aTamassia, Roberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540633075
776 0 8 _iPrinted edition:
_z9783662199244
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1272
856 4 0 _uhttps://doi.org/10.1007/3-540-63307-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188051
_d188051