Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and data structures : 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005 : proceedings / / Frank Dehne, Alejandro Lopez-Ortiz, Jorg-Rudiger Sack (eds.)
| Algorithms and data structures : 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005 : proceedings / / Frank Dehne, Alejandro Lopez-Ortiz, Jorg-Rudiger Sack (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XIV, 446 p.) |
| Disciplina | 005.7/3 |
| Altri autori (Persone) |
DehneF <1960-> (Frank)
Lopez-OrtizAlejandro SackJ.-R <1954-> (Jorg-Rudiger) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Data structures (Computer science)
Computer algorithms |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching. |
| Altri titoli varianti | WADS 2005 |
| Record Nr. | UNINA-9910483626003321 |
| Berlin ; ; New York, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of computational geometry / / edited by J.-R. Sack, J. Urrutia
| Handbook of computational geometry / / edited by J.-R. Sack, J. Urrutia |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York ; ; Amsterdam, : Elsevier, 2000 |
| Descrizione fisica | 1 online resource (1087 p.) |
| Disciplina | 516/.00285 |
| Altri autori (Persone) |
SackJ.-R <1954-> (Jorg-Rudiger)
UrrutiaJ (Jorge) |
| Soggetto topico |
Geometry - Data processing
Computer graphics Combinatorial geometry |
| ISBN |
1-281-05842-4
9786611058425 0-08-052968-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Handbook of Computational Geometry; Copyright Page; Preface; List of Contributors; Contents; Chapter 1. Davenport-Schinzel sequences and their geometric applications; Chapter 2. Arrangements and their applications; Chapter 3. Discrete geometric shapes: Matching, interpolation, and approximation; Chapter 4. Deterministic parallel computational geometry; chapter 5. Voronoi diagrams; Chapter 6. Mesh generation; Chapter 7. Applications of computational geometry to geographic information systems
Chapter 8. Making geometry visible: An introduction to the animation of geometric algorithmsChapter 9. Spanning trees and spanners; Chapter 10. Geometric data structures; Chapter 11. Polygon decomposition; Chapter 12. Link distance problems; Chapter 13. Derandomization in computational geometry; Chapter 14. Robustness and precision issues in geometric computation; Chapter 15. Geometric shortest paths and network optimization; Chapter 16. Randomized algorithms in computational geometry; Chapter 17. Spatial data structures: Concepts and design choices Chapter 18. Parallel computational geometry: An approach using randomizationChapter 19. Visibility in the plane; Chapter 20. Closest-point problems in computational geometry; Chapter 21. Graph drawing; Chapter 22. Art gallery and illumination problems; Author Index; Subject Index |
| Record Nr. | UNINA-9910827378403321 |
| New York ; ; Amsterdam, : Elsevier, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||