libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

dondi riccardo (curatore); fertin guillaume (curatore); mauri giancarlo (curatore) - algorithmic aspects in information and management

Algorithmic Aspects in Information and Management 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings

; ;




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
54,98 €
NICEPRICE
52,23 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 07/2016
Edizione: 1st ed. 2016





Trama

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.






Sommario

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.










Altre Informazioni

ISBN:

9783319411675

Condizione: Nuovo
Collana: Lecture Notes in Computer Science
Dimensioni: 235 x 155 mm
Formato: Brossura
Illustration Notes:XIV, 223 p. 36 illus.
Pagine Arabe: 223
Pagine Romane: xiv


Dicono di noi