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

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

ISBN-10:
3319411675
ISBN-13:
9783319411675
Pub. Date:
08/12/2016
Publisher:
Springer International Publishing
ISBN-10:
3319411675
ISBN-13:
9783319411675
Pub. Date:
08/12/2016
Publisher:
Springer International Publishing
Algorithmic Aspects in Information and Management: 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings

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

$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    Not Eligible for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.




Product Details

ISBN-13: 9783319411675
Publisher: Springer International Publishing
Publication date: 08/12/2016
Series: Lecture Notes in Computer Science , #9778
Edition description: 1st ed. 2016
Pages: 223
Product dimensions: 6.10(w) x 9.25(h) x (d)

Table of 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 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.
From the B&N Reads Blog

Customer Reviews