Algorithm theory - SWAT '96 : 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3 5, 1996 : proceedings

This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996. The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstrac...

詳細記述

保存先:
書誌詳細
団体著者: Scandinavian Workshop on Algorithm Theory :Reykjavík
その他の著者: Karlsson, Rolf, 1950- (出版デイレクター), Lingas, Andrzej (出版デイレクター)
フォーマット: Livre numérique
言語:Anglais
出版事項: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
シリーズ:Lecture notes in computer science 1097
主題:
オンライン・アクセス:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
注記: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithm theory-- SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, proceedings, Rolf Karlsson, Andrzej Lingas (eds.), 1996, Berlin, Springer, 1 vol. (IX-451 p.), Lecture notes in computer science, 3-540-61422-2
• Algorithm Theory - SWAT '96, Texte imprimé, 9783662171943
LEADER 05078nam a22004337a 4500
001 945465
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155228811
020 |a 9783540685296 (PDF) 
041 0 |a eng 
082 |a 005.1 
082 |a 004 
111 2 |a Scandinavian Workshop on Algorithm Theory  |n (05  |d  :1996  |c  :Reykjavík). 
245 1 0 |a Algorithm theory - SWAT '96 :  |b 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3 5, 1996 : proceedings   |c [edited by] Rolf Karlsson, Andrzej Lingas. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1097  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Derandomization via small sample spaces -- The randomized complexity of maintaining the minimum -- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning -- Service-constrained network design problems -- Approximate hypergraph coloring -- Facility dispersion and remote subgraphs -- The constrained minimum spanning tree problem -- Randomized approximation of the constraint satisfaction problem -- On the hardness of global and local approximation -- Approximation algorithms for the maximum satisfiability problem -- On the hardness of approximating the minimum consistent OBDD problem -- Computing the unrooted maximum agreement subtree in sub-quadratic time -- Greedily finding a dense subgraph -- Using sparsification for parametric minimum spanning tree problems -- Vertex partitioning problems on partial k-trees -- Making an arbitrary filled graph minimal by removing fill edges -- Sorting and searching revisted -- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching -- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees -- Neighborhood graphs and distributed ?+1-coloring -- Communication complexity of gossiping by packets -- Optimal cost-sensitive distributed minimum spanning tree algorithm -- A linear time algorithm for the feasibility of pebble motion on trees -- Linear-time heuristics for minimum weight rectangulation -- Visibility with multiple reflections -- A fast heuristic for approximating the minimum weight triangulation -- Neighbours on a grid -- On two dimensional packing -- Optimal orthogonal drawings of triconnected plane graphs -- Walking streets faster -- Safe and efficient traffic laws for mobile robots -- Progress in selection -- Probabilistic ancestral sequences and multiplealignments -- Efficient algorithms for Lempel-Ziv encoding -- The deterministic complexity of parallel multisearch -- Priority queues on parallel machines -- Binary search trees: How low can you go? -- Boolean analysis of incomplete examples. 
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 book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996. The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstracts or full versions of three invited talks by prominent researchers. All in all, the collection of articles reports state-of-the-art results on various topics of current design and analysis of algorithms. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Complexité de calcul (informatique) 
650 |a Analyse combinatoire 
650 |a Structures de données (informatique) 
650 |a Actes de congrès 
700 1 |a Karlsson, Rolf,  |d 1950-  |4 pbd 
700 1 |a Lingas, Andrzej.  |4 pbd 
776 0 |0 025995308  |t Algorithm theory-- SWAT '96  |o 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996  |o proceedings  |f Rolf Karlsson, Andrzej Lingas (eds.)  |d 1996  |c Berlin  |n Springer  |p 1 vol. (IX-451 p.)  |s Lecture notes in computer science  |z 3-540-61422-2 
776 0 |t Algorithm Theory - SWAT '96  |b Texte imprimé  |z 9783662171943 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-61422-2  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-WJP9VJPG-5  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747910294  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-61422-2  |z Accès Université d'Orléans 
856 4 |5 180339901:750923156  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-61422-2  |z Accès INSA CVL 
997 |0 945465  |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/