Del 9778 i serien Lecture Notes in Computer Science

Algorithmic Aspects in Information and Management

11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings

Häftad, Engelska, 2016

AvRiccardo Dondi,Guillaume Fertin,Giancarlo Mauri

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2016-07-05
Mått155 x 235 x 14 mm
Vikt371 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor223
FörlagSpringer International Publishing AG
ISBN9783319411675

Tillhör följande kategorier

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.