Algorithms and Complexity: 4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings: Lecture Notes in Computer Science, cartea 1767
Editat de Giancarlo Bongiovanni, Giorgio Gambosi, Rosella Petreschien Limba Engleză Paperback – 16 feb 2000
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei -
Preț: 395.25 lei - 20%
Preț: 327.36 lei - 20%
Preț: 556.96 lei - 20%
Preț: 400.77 lei - 15%
Preț: 558.12 lei - 20%
Preț: 328.94 lei - 20%
Preț: 340.04 lei - 20%
Preț: 487.46 lei - 20%
Preț: 629.71 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 620.33 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 782.57 lei - 20%
Preț: 679.09 lei - 20%
Preț: 330.54 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 984.64 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 793.92 lei - 20%
Preț: 324.19 lei - 20%
Preț: 733.68 lei - 20%
Preț: 336.86 lei - 20%
Preț: 327.36 lei - 20%
Preț: 573.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 850.42 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 631.96 lei - 20%
Preț: 568.70 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 321.49 lei
Preț vechi: 401.86 lei
-20%
Puncte Express: 482
Preț estimativ în valută:
56.83€ • 67.76$ • 49.29£
56.83€ • 67.76$ • 49.29£
Carte tipărită la comandă
Livrare economică 16-30 martie
Specificații
ISBN-13: 9783540671596
ISBN-10: 3540671595
Pagini: 332
Ilustrații: VIII, 324 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.47 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540671595
Pagini: 332
Ilustrații: VIII, 324 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.47 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Presentations.- On Salesmen, Repairmen, Spiders, and Other Traveling Agents.- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.- Algorithms for a Simple Point Placement Problem.- Duality in ATM Layout Problems.- Regular Presentations.- The Independence Number of Random Interval Graphs.- Online Strategies for Backups.- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.- Semantical Counting Circuits.- The Hardness of Placing Street Names in a Manhattan Type Map.- Labeling Downtown.- The Online Dial-a-Ride Problem under Reasonable Load.- The Online-TSP against Fair Adversaries.- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms.- Triangulations without Minimum-Weight Drawing.- Faster Exact Solutions for Max2Sat.- Dynamically Maintaining the Widest k-Dense Corridor.- Reconstruction of Discrete Sets from Three or More X-Rays.- Modified Binary Searching for Static Tables.- An Efficient Algorithm for the Approximate Median Selection Problem.- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.- Group Updates for Bed-Black Trees.- Approximating SVP ? to within Almost-Polynomial Factors Is NP-Hard.- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.- On the Lovász Number of Certain Circulant Graphs.- Speeding Up Pattern Matching by Text Compression.
Caracteristici
Includes supplementary material: sn.pub/extras