000 04220nam a22005415i 4500
001 978-3-540-69106-8
003 DE-He213
005 20160624102053.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540691068
_9978-3-540-69106-8
024 7 _a10.1007/BFb0054349
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAlgorithm Theory — SWAT'98
_h[electronic resource] :
_b6th Scandinavian Workshop on Algorithm Theory Stockholm, Sweden, July 8–10, 1998 Proceedings /
_cedited by Stefan Arnborg, Lars Ivansson.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1998.
300 _aX, 350 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,
_x0302-9743 ;
_v1432
505 0 _aRecent developments in maximum flow algorithms -- An ? — Approximation algorithm for weighted shortest paths on polyhedral surfaces -- Facility location with dynamic distance functions -- An approximation scheme for bin packing with conflicts -- Approximations for the general block distribution of a matrix -- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments -- Moving an angle around a region -- Models and motion planning -- Constrained square-center problems -- Worst-case efficient external-memory priority queues -- Simple confluently persistent catenable lists -- Improved upper bounds for time-space tradeoffs for selection with limited storage -- Probabilistic data structures for priority queues -- Extractors for weak random sources and their applications -- Comparator networks for binary heap construction -- Two-variable linear programming in parallel -- Optimal deterministic protocols for mobile robots on a grid -- Concurrent multicast in weighted networks -- Some recent strong inapproximability results -- Minimal elimination of planar graphs -- Memory requirements for table computations in partial k-tree algorithms -- Formal language constrained path problems -- Local search algorithms for SAT: Worst-case analysis -- Speed is more powerful than clairvoyance -- Randomized online multi-threaded paging -- Determinant: Old algorithms, new insights -- Solving fundamental problems on sparse-meshes -- Output-sensitive cell enumeration in hyperplane arrangements -- Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology -- On the number of regular vertices of the union of Jordan regions -- Distribution-sensitive algorithms.
520 _aThis book constitutes the refereed proceedings of the 6th Scandinavian Workshop on Algorithm Theory, SWAT'98, held in Stockholm, Sweden, in July 1998. The volume presents 28 revised full papers selected from 56 submissions; also included are three invited contributions. The papers present original research on algorithms and data structures in various areas including computational geometry, parallel and distributed systems, graph theory, approximation, computational biology, queueing, Voronoi diagrams, and combinatorics in general.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
650 2 4 _aComputer Graphics.
700 1 _aArnborg, Stefan.
_eeditor.
700 1 _aIvansson, Lars.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540646822
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1432
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0054349
942 _2EBK7131
_cEBK
999 _c36425
_d36425