SWAT 90 : 2nd Scandinavian workshop on algorithm theory, Bergen, Sweden, July 11 14, 1990 : proceedings

This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor Corporativo: Scandinavian Workshop on Algorithm Theory :Bergen
Otros Autores: Gilbert, John R. (Director de publicación), Karlsson, Rolf, 1950- (Director de publicación)
Formato: Livre numérique
Lenguaje:Anglais
Publicado: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Colección:Lecture notes in computer science 447
Materias:
Acceso en línea:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• SWAT 90, proceedings, 2nd Scandinavian Workshop on Algorithm Theory, Berger, Norway, July 11-14, 1990, Berlin, Springer-Verlag, 1990, 1 vol. (VI-417 p.), Lecture notes in computer science, 3-540-52846-6
• SWAT '90, Texte imprimé, 9783662172636
LEADER 05223nam a22004457a 4500
001 944973
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155209477
020 |a 9783540471646 (PDF) 
041 0 |a eng 
082 |a 310 
082 |a 004 
111 2 |a Scandinavian Workshop on Algorithm Theory  |n (02  |d  :1990  |c  :Bergen). 
245 1 0 |a SWAT 90 :  |b 2nd Scandinavian workshop on algorithm theory, Bergen, Sweden, July 11 14, 1990 : proceedings   |c [edited by] John R. Gilbert, Rolf Karlsson. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 447  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Structural complexity theory: Recent surprises -- Approximating maximum independent sets by excluding subgraphs -- Generating sparse spanners for weighted graphs -- Finding the k smallest spanning trees -- The file distribution problem for processor networks -- Translating polygons with applications to hidden surface removal -- Output-sensitive generation of the perspective view of isothetic parallelepipeds -- Graphics in flatland revisited -- The visibility diagram: A data structure for visibility problems and motion planning -- Fast updating of well-balanced trees -- How to update a balanced binary tree with a constant number of rotations -- Ranking trees generated by rotations -- Expected behaviour analysis of AVL trees -- Analysis of the expected search cost in skip lists -- Lower bounds for monotonic list labeling -- Sorting shuffled monotone sequences -- A faster parallel algorithm for a matrix searching problem -- A rectilinear steiner minimal tree algorithm for convex point sets -- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric -- Input-sensitive compliant motion in the plane -- Fast algorithms for greedy triangulation -- Star unfolding of a polytope with applications -- Space-sweep algorithms for parametric optimization -- Approximating finite weighted point sets by hyperplanes -- Data structures for Traveling Salesmen -- Efficient parallel algorithms for shortest paths in planar graphs -- The pathwidth and treewidth of cographs -- Canonical representations of partial 2-and 3-trees -- On matroids and hierarchical graphs -- Fast algorithms for two dimensional and multiple pattern matching -- Boyer-Moore approach to approximate string matching -- Complete problems with L-samplable distributions -- Upper envelope onion peeling -- Applications of a semi-dynamic convex hull algorithm -- Intersection queries in sets of disks -- Dynamic partition trees. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Complexité de calcul (informatique) 
650 |a Probabilités 
650 |a Analyse combinatoire 
650 |a Structures de données (informatique) 
650 |a Actes de congrès 
700 1 |a Gilbert, John R.  |4 pbd 
700 1 |a Karlsson, Rolf,  |d 1950-  |4 pbd 
776 0 |0 021630046  |t SWAT 90  |o proceedings  |f 2nd Scandinavian Workshop on Algorithm Theory, Berger, Norway, July 11-14, 1990  |c Berlin  |n Springer-Verlag  |d 1990  |p 1 vol. (VI-417 p.)  |s Lecture notes in computer science  |z 3-540-52846-6 
776 0 |t SWAT '90  |b Texte imprimé  |z 9783662172636 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-52846-6  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-8W5XBW9N-8  |z Accès sur la plateforme Istex 
856 4 |5 452349901:74791480X  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-52846-6  |z Accès Université d'Orléans 
856 4 |5 180339901:750927488  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-52846-6  |z Accès INSA CVL 
997 |0 944973  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/