Algorithm Theory – SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings: Lecture Notes in Computer Science, cartea 5124
Editat de Joachim Gudmundssonen Limba Engleză Paperback – 19 iun 2008
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 763.23 lei
Preț vechi: 954.04 lei
-20% Nou
Puncte Express: 1145
Preț estimativ în valută:
146.07€ • 152.09$ • 123.44£
146.07€ • 152.09$ • 123.44£
Carte disponibilă
Livrare economică 14-28 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540699002
ISBN-10: 3540699007
Pagini: 453
Ilustrații: XIII, 438 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.68 kg
Ediția:2008
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: 3540699007
Pagini: 453
Ilustrații: XIII, 438 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.68 kg
Ediția:2008
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
Invited Lectures.- A Survey of Results for Deletion Channels and Related Synchronization Channels.- Nash Bargaining Via Flexible Budget Markets.- Contributed Papers.- Simplified Planar Coresets for Data Streams.- Uniquely Represented Data Structures for Computational Geometry.- I/O Efficient Dynamic Data Structures for Longest Prefix Queries.- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.- Vision-Based Pursuit-Evasion in a Grid.- Angle Optimization in Target Tracking.- Improved Bounds for Wireless Localization.- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem.- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.- The Maximum Energy-Constrained Dynamic Flow Problem.- Bounded Unpopularity Matchings.- Data Structures with Local Update Operations.- On the Redundancy of Succinct Data Structures.- Confluently Persistent Tries for Efficient Version Control.- A Uniform Approach Towards Succinct Representation of Trees.- An Algorithm for L(2,1)-Labeling of Trees.- Batch Coloring Flat Graphs and Thin.- Approximating the Interval Constrained Coloring Problem.- A Path Cover Technique for LCAs in Dags.- Boundary Labeling with Octilinear Leaders.- Distributed Disaster Disclosure.- Reoptimization of Steiner Trees.- On the Locality of Extracting a 2-Manifold in .- On Metric Clustering to Minimize the Sum of Radii.- On Covering Problems of Rado.- Packing Rectangles into 2OPT Bins Using Rotations.- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.- On a Special Co-cycle Basis of Graphs.- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.- Spanners of Additively Weighted Point Sets.- The Kinetic Facility Location Problem.- Computing the Greedy Spanner in Near-Quadratic Time.- Parameterized Computational Complexity of Dodgson and Young Elections.- Online Compression Caching.- On Trade-Offs in External-Memory Diameter-Approximation.