1 option
Algorithmic Aspects in Information and Management : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9778.
- Theoretical Computer Science and General Issues ; 9778
- Language:
- English
- Subjects (All):
- Computer science--Mathematics.
- Computer science.
- Algorithms.
- Data structures (Computer science).
- Pattern perception.
- Computer networks.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Pattern Recognition.
- Computer Communication Networks.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Pattern Recognition.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XIV, 223 pages) : 36 illustrations.
- Edition:
- First edition 2016.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-41168-2
- 9783319411682
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.