Algorithmic Aspects in Information and Management
11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings
Published on 5. July 2016
Book
Paperback/Softback
XIV, 223 pages
978-3-319-41167-5 (ISBN)
Description
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.
More details
Series
Edition
1st ed. 2016
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
36 s/w Abbildungen
XIV, 223 p. 36 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 14 mm
Weight
371 gr
ISBN-13
978-3-319-41167-5 (9783319411675)
DOI
10.1007/978-3-319-41168-2
Schweitzer Classification
Other editions
Additional editions
Riccardo Dondi | Guillaume Fertin | Giancarlo Mauri
Algorithmic Aspects in Information and Management
11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings
E-Book
07/2016
Springer
€53.49
Available for download
Content
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.