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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Dondi, Riccardo (Επιμελητής έκδοσης), Fertin, Guillaume (Επιμελητής έκδοσης), Mauri, Giancarlo (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
• Σειρά: Lecture Notes in Computer Science, 9778
• Θέματα: Computer science.; Computer communication systems.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Pattern recognition.; Computer Science.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.; Data Structures.; Pattern Recognition.; Computer Communication Networks.

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 curr...

Πίνακας περιεχομένων:

• 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 Sets via 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.