Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Aspects in Information and Management: 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings de Riccardo Dondi

Algorithmic Aspects in Information and Management: 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9778

Editat de Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
en Limba Engleză Paperback – 5 iul 2016
This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016.
The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32958 lei

Preț vechi: 41198 lei
-20% Nou

Puncte Express: 494
Preț estimativ în valută:
6308€ • 6561$ • 5286£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

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

Specificații

ISBN-13: 9783319411675
ISBN-10: 3319411675
Pagini: 220
Ilustrații: XIV, 223 p. 36 illus.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.34 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

Item Pricing for Combinatorial Public Projects.- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves.- On the Complexity of Clustering with Relaxed Size Constraints.- Superstring Graph: A New Approach for Genome Assembly.- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.- A Very Fast String Matching Algorithm Based on Condensed Alphabets.- Minimum-Density Identifying Codes in Square Grids.- Separating Codes and Traffic Monitoring.- Know When to Persist: Deriving Value from a Stream Buffer.- Algorithmic Aspects of Upper Domination: A Parameterised Perspective.- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games.- Parameterized Complexity of Team Formation in Social Networks.- Reconstructing Cactus Graphs from Shortest Path Information.- Near-Optimal Dominating Setsvia Random Sampling.- A Multivariate Approach for Checking Resiliency in Access Control.- Efficient Algorithms for the Order Preserving Pattern Matching Problem.- Computing the Line-Constrained k-Center in the Plane for Small k.- Online k-max Search Algorithm with Applications to the Secretary Problem.

Caracteristici

Includes supplementary material: sn.pub/extras