Algorithmic aspects in information and management : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri (eds.).
- 作者： AAIM (Conference) (11th 2016 Bergamo, Italy)
- 其他作者：
- 其他題名：
- Lecture notes in computer science ;
- LNCS sublibrary..
- 出版： Switzerland : Springer 2016.
- 叢書名： Lecture notes in computer science ,9778 , LNCS sublibrary, SL 1, Theoretical computer science and generalissues
- 主題： Computer algorithms--Congresses , Management science--Data processing--Congresses.
- ISBN： 9783319411675 (bk.) :: NT$1693.00 、 9783319411682 (ebook) 、 3319411683 (ebook)
- 書目註：Includes bibliographical references and index.
-
讀者標籤：
- 系統號： 005152433 | 機讀編目格式
館藏資訊
摘要註
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 trendsof research on algorithms, data structures, operation research, combinatorial optimization and their applications.
內容註
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 Basedon 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 -- ReconstructingCactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithmsfor 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.