Algorithm theory - SWAT 2000 : 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5 7, 2000 : proceedings
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
1851 |
| 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: | • Algorithm theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 5-7, 2000, Magnus M. Halldórsson (Ed.), 2000, Berlin, Springer, 1 vol. (XI-564 p.), Lecture notes in computer science, 3-540-67690-2 • Algorithm Theory - SWAT 2000, Texte imprimé, 9783662207161 |
| LEADER | 05388nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 948616 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15517634X | ||
| 020 | |a 9783540449850 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Scandinavian Workshop on Algorithm Theory |n (07 |d :2000 |c :Stockholm). | |
| 245 | 1 | 0 | |a Algorithm theory - SWAT 2000 : |b 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5 7, 2000 : proceedings |c [edited by] Magnus M. Halldórsson. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1851 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talks -- Dynamic Graph Algorithms with Applications -- Coping with the NP-Hardness of the Graph Bandwidth Problem -- Toward Complete Genome Data Mining in Computational Biology -- Data Structures -- A New Trade-Off for Deterministic Dictionaries -- Improved Upper Bounds for Pairing Heaps -- Maintaining Center and Median in Dynamic Trees -- Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time -- Graph Algorithms -- A Dynamic Algorithm for Maintaining Graph Partitions -- Data Structures for Maintaining Set Partitions -- Graph Algorithms -- Fixed Parameter Algorithms for Planar Dominating Set and Related Problems -- Embeddings of k-Connected Graphs of Pathwidth k -- On Graph Powers for Leaf-Labeled Trees -- Recognizing Weakly Triangulated Graphs by Edge Separability -- Online Algorithms -- Caching for Web Searching -- On-Line Scheduling with Precedence Constraints -- Scheduling Jobs Before Shut-Down -- Resource Augmentation in Load Balancing -- Fair versus Unrestricted Bin Packing -- Approximation Algorithms -- A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs -- Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems -- Approximation Algorithms for Maximum Linear Arrangement -- Approximation Algorithms for Clustering to Minimize the Sum of Diameters -- Matchings -- Robust Matchings and Maximum Clustering -- The Hospitals/Residents Problem with Ties -- Network Design -- Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph -- On the Minimum Augmentation of an ?-Connected Graph to a k-Connected Graph -- Locating Sources to Meet Flow Demands in Undirected Networks -- Improved Greedy Algorithms for Constructing Sparse Geometric Spanners -- Computational Geometry -- Computing the Penetration Depth ofTwo Convex Polytopes in 3D -- Compact Voronoi Diagrams for Moving Convex Polygons -- Efficient Expected-Case Algorithms for Planar Point Location -- A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon -- Strings and Algorithm Engineering -- The Enhanced Double Digest Problem for DNA Physical Mapping -- Generalization of a Suffix Tree for RNA Structural Pattern Matching -- Efficient Computation of All Longest Common Subsequences -- A Blocked All-Pairs Shortest-Paths Algorithm -- External Memory Algorithms -- On External-Memory MST, SSSP, and Multi-way Planar Graph Separation -- I/O-Space Trade-Offs -- Optimization -- Optimal Flow Aggregation -- On the Complexities of the Optimal Rounding Problems of Sequences and Matrices -- On the Complexity of the Sub-permutation Problem -- Parallel Attribute-Efficient Learning of Monotone Boolean Functions -- Distributed Computing and Fault-Tolerance -- Max- and Min-Neighborhood Monopolies -- Optimal Adaptive Fault Diagnosis of Hypercubes -- Fibonacci Correction Networks -- Least Adaptive Optimal Search with Unreliable Tests. | |
| 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 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Halldórsson, Magnús M., |c informaticien. |4 pbd | |
| 776 | 0 | |0 052244725 |t Algorithm theory - SWAT 2000 |o 7th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 5-7, 2000 |f Magnus M. Halldórsson (Ed.) |d 2000 |c Berlin |n Springer |p 1 vol. (XI-564 p.) |s Lecture notes in computer science |z 3-540-67690-2 | |
| 776 | 0 | |t Algorithm Theory - SWAT 2000 |b Texte imprimé |z 9783662207161 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44985-X |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-G9RFCB5T-T |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748059121 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44985-X |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751510637 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44985-X |z Accès INSA CVL | |
| 997 | |0 948616 |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/ | ||