Algorithms ESA 2004 : 12th annual european symposium, Bergen, Norway, september 14-17, 2004 : proceedings
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | , |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
3221 |
| Предметы: | |
| Online-ссылка: | 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: | • Algorithms, ESA 2004, 12th annual european symposium, Bergen, Norway, september 14-17, 2004, proceedings, Susanne Albers, Tomasz Radzik (eds.), Berlin, Springer, 2004, 1 vol. (XVIII-836 p.), Lecture notes in computer science, 3-540-23025-4 • Algorithms -- ESA 2004, Texte imprimé, 9783662206737 |
| LEADER | 06683nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 969871 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155180878 | ||
| 020 | |a 9783540301400 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 005.1 | ||
| 111 | 2 | |a ESA 2004 |n (12 |d :2004 |c :Bergen, NO). | |
| 245 | 1 | 0 | |a Algorithms ESA 2004 : |b 12th annual european symposium, Bergen, Norway, september 14-17, 2004 : proceedings |c [edited by] Susanne Albers, Tomasz Radzik. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 3221 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal sArrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths. | |
| 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 Réseaux d'ordinateurs | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Albers, Susanne. |4 pbd | |
| 700 | 1 | |a Radzik, Tomasz. |4 pbd | |
| 776 | 0 | |0 082151334 |t Algorithms |o ESA 2004 |o 12th annual european symposium, Bergen, Norway, september 14-17, 2004 |o proceedings |f Susanne Albers, Tomasz Radzik (eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (XVIII-836 p.) |s Lecture notes in computer science |z 3-540-23025-4 | |
| 776 | 0 | |t Algorithms -- ESA 2004 |b Texte imprimé |z 9783662206737 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b100428 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-N08N87XK-G |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750669284 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b100428 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754018318 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b100428 |z Accès INSA CVL | |
| 997 | |0 969871 |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/ | ||