Cantitate/Preț
Produs
Total produse
Vezi coșul
Experimental Algorithms: 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings de Andrew V. Goldberg

Experimental Algorithms: 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9685

Editat de Andrew V. Goldberg, Alexander S. Kulikov
en Limba Engleză Paperback – iun 2016
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016.
The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33201 lei

Preț vechi: 41501 lei
-20% Nou

Puncte Express: 498
Preț estimativ în valută:
6354€ • 6619$ • 5283£

Carte tipărită la comandă

Livrare economică 11-25 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319388502
ISBN-10: 3319388509
Pagini: 382
Ilustrații: XVI, 386 p. 96 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Practical Variable Length Gap Pattern Matching using Wavelet Trees.- Fast Exact Computation of Isochrones in Road Networks.- Dynamic Time-Dependent Route Planning in Road Networks with User Preferences.- UKP5: a New Algorithm for the Unbounded Knapsack Problem.- Lempel-Ziv Decoding in External Memory.- A Practical Method for the Minimum Genus of a Graph: Models and Experiments.- Compact Flow Diagrams for State Sequences.- Practical Dynamic Entropy-Compressed Bitvectors with Applications.- Accelerating Local Search for the Maximum Independent Set Problem.- Computing Nonsimple Polygons of Minimum Perimeter.- Sparse Subgraphs for 2-Connectivity in Directed Graphs.- Worst-Case-Efficient Dynamic Arrays in Practice.- On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors.- Engineering Hybrid DenseZDDs.- Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances.- Tractable Pathfinding for the Stochastic On-Time Arrival Problem.- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem.- Experimental Analysis of Algorithms for Coflow Scheduling.- An Empirical Study of Online Packet Scheduling Algorithms.- Advanced Multilevel Node Separator Algorithms.- A merging heuristic for the rectangle decomposition of binary matrice.- CHICO: A Compressed Hybrid Index for Repetitive Collections.- Fast Scalable Construction of (Minimal Perfect Hash) Functions.- Better partitions of protein graphs for subsystem quantum chemistry.- Online Algorithm for Approximate Quantile Queries on Sliding Windows.

Caracteristici

Includes supplementary material: sn.pub/extras