Algorithm theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004 : proceedings
Gorde:
| Egile nagusia: | |
|---|---|
| Erakunde egilea: | |
| Beste egile batzuk: | |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
3111 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004, proceedings, Torben Hagerup, Jyrki Katajainen (eds.), Berlin, Springer, 2004, 1 vol. (XI-506 p.), Lecture notes in computer science, 3-540-22339-8 • Algorithm Theory - SWAT 2004, Texte imprimé, 9783662209110 |
| LEADER | 05055nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 972052 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155217623 | ||
| 020 | |a 9783540278108 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 518.1 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Hagerup, Torgen. | |
| 245 | 1 | 0 | |a Algorithm theory - SWAT 2004 : |b 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004 : proceedings |c [edited by] Torben Hagerup, Jyrki Katajainen. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 3111 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( ) Approximation Algorithm for the Stable Marriage Problem.-Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs. | |
| 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 Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Katajainen, Jyrki. |4 pbd | |
| 711 | 2 | |a Scandinavian workshop on algorithm theory |n (9 |d :2004 |c :Humlebæk, DK). |4 aut | |
| 776 | 0 | |0 080620183 |t Algorithm theory |o SWAT 2004 |o 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004 |o proceedings |f Torben Hagerup, Jyrki Katajainen (eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (XI-506 p.) |s Lecture notes in computer science |z 3-540-22339-8 | |
| 776 | 0 | |t Algorithm Theory - SWAT 2004 |b Texte imprimé |z 9783662209110 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b98413 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-MXL5MR49-4 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750645733 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b98413 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753996723 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b98413 |z Accès INSA CVL | |
| 997 | |0 972052 |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/ | ||