Algorithms and Data Structures: 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4619
Editat de Frank Dehne, Jörg-Rüdiger Sack, Norbert Zehen Limba Engleză Paperback – 30 iul 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 571.63 lei
- 20% Preț: 336.71 lei
- 20% Preț: 333.46 lei
- 20% Preț: 662.76 lei
- 20% Preț: 330.23 lei
- 20% Preț: 747.79 lei
- 20% Preț: 438.67 lei
- 20% Preț: 369.12 lei
- 20% Preț: 315.76 lei
- 20% Preț: 584.40 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 315.18 lei
- 20% Preț: 256.26 lei
- 20% Preț: 1040.03 lei
- 20% Preț: 504.56 lei
- Preț: 402.62 lei
- 20% Preț: 346.40 lei
- 20% Preț: 301.94 lei
- 20% Preț: 237.99 lei
- 5% Preț: 365.59 lei
- 20% Preț: 309.89 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.25 lei
- 20% Preț: 334.68 lei
- Preț: 373.56 lei
- 20% Preț: 172.68 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 315.76 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 444.17 lei
- 20% Preț: 567.60 lei
- 20% Preț: 632.22 lei
- 17% Preț: 360.18 lei
- 20% Preț: 538.28 lei
- 20% Preț: 335.08 lei
- 20% Preț: 307.68 lei
- 20% Preț: 343.16 lei
- 20% Preț: 641.78 lei
- 20% Preț: 579.56 lei
- 20% Preț: 1053.45 lei
- 15% Preț: 568.74 lei
- Preț: 389.47 lei
- 20% Preț: 333.46 lei
- 20% Preț: 607.38 lei
- 20% Preț: 326.97 lei
Preț: 677.96 lei
Preț vechi: 847.46 lei
-20% Nou
Puncte Express: 1017
Preț estimativ în valută:
129.73€ • 136.49$ • 107.41£
129.73€ • 136.49$ • 107.41£
Carte tipărită la comandă
Livrare economică 14-28 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540739487
ISBN-10: 3540739483
Pagini: 682
Ilustrații: XVI, 664 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 1.7 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540739483
Pagini: 682
Ilustrații: XVI, 664 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 1.7 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Session 1.- Finding Small Holes.- Session 2A.- Approximate Range Searching: The Absolute Model.- Orthogonal Range Searching in Linear and Almost-Linear Space.- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere.- Session 2B.- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity.- Approximating the Maximum Sharing Problem.- The Stackelberg Minimum Spanning Tree Game.- Session 3A.- Edges and Switches, Tunnels and Bridges.- How to Draw a Clustered Tree.- Drawing Colored Graphs on Colored Points.- Session 3B.- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric.- Priority Queues Resilient to Memory Faults.- Simple and Space-Efficient Minimal Perfect Hash Functions.- Session 4A.- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems.- Optimization for First Order Delaunay Triangulations.- Session 4B.- Constant Factor Approximations for the Hotlink Assignment Problem.- Approximation Algorithms for the Sex-Equal Stable Marriage Problem.- A Stab at Approximating Minimum Subadditive Join.- Session 5.- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets.- Session 6A.- Flooding Countries and Destroying Dams.- I/O-Efficient Flow Modeling on Fat Terrains.- Computing the Visibility Map of Fat Objects.- Session 6B.- Independent Sets in Bounded-Degree Hypergraphs.- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon.- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time.- Session 7A.- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.-Spanners for Geometric Intersection Graphs.- On Generalized Diamond Spanners.- Session 7B.- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.- On the Robustness of Graham’s Algorithm for Online Scheduling.- Improved Results for a Memory Allocation Problem.- Session 8A.- Computational and Structural Advantages of Circular Boundary Representation.- Alpha-Beta Witness Complexes.- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra.- Session 8B.- Fixed-Parameter Tractability for Non-Crossing Spanning Trees.- Improved Algorithms for the Feedback Vertex Set Problems.- Kernelization Algorithms for d-Hitting Set Problems.- Session 9A.- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points.- Maximizing Maximal Angles for Plane Straight-Line Graphs.- Cuttings for Disks and Axis-Aligned Rectangles.- Session 9B.- Kernelization and Complexity Results for Connectivity Augmentation Problems.- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.- Branch and Recharge: Exact Algorithms for Generalized Domination.- Session 10A.- On Computing the Centroid of the Vertices of an Arrangement and Related Problems.- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p.- Session 10B.- Faster Approximation of Distances in Graphs.- Approximate Shortest Paths Guided by a Small Index.- Session 11A.- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model.- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field.- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality.- On Euclidean Vehicle Routing with Allocation.- Session 11B.- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets.- Range Non-overlappingIndexing and Successive List Indexing.- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters.- Dynamic TCP Acknowledgment with Sliding Window.