Experimental Algorithms : 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings / edited by Andrew V. Goldberg, Alexander S. Kulikov.

Format:

• Book

Contributor:

• Goldberg, Andrew V., editor.
• Kulikov, Alexander S., editor.
• SpringerLink (Online service)

Series:

• Computer Science (Springer-11645)
• LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9685.
• Theoretical Computer Science and General Issues ; 9685

Language:

English

Subjects (All):

• Algorithms.
• Computer science--Mathematics.
• Data structures (Computer science).
• Numerical analysis.
• Artificial intelligence.
• Algorithm Analysis and Problem Complexity.
• Discrete Mathematics in Computer Science.
• Data Structures.
• Numeric Computing.
• Artificial Intelligence.

Local Subjects:

• Algorithm Analysis and Problem Complexity.
• Discrete Mathematics in Computer Science.
• Data Structures.
• Numeric Computing.
• Algorithms.
• Artificial Intelligence.

Physical Description:

1 online resource (XVI, 386 pages) : 96 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 book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.

Contents:

• Practical Variable Length Gap Pattern Matching using Wavelet Trees
• Fast Exact Computation of Isochrones in Road Networks
• Dynamic Time-Dependent Route Planning in Road Networks with User Preferences
• UKP5: a New Algorithm for the Unbounded Knapsack Problem
• Lempel-Ziv Decoding in External Memory
• A Practical Method for the Minimum Genus of a Graph: Models and Experiments
• Compact Flow Diagrams for State Sequences
• Practical Dynamic Entropy-Compressed Bitvectors with Applications
• Accelerating Local Search for the Maximum Independent Set Problem
• Computing Nonsimple Polygons of Minimum Perimeter
• Sparse Subgraphs for 2-Connectivity in Directed Graphs
• Worst-Case-Efficient Dynamic Arrays in Practice
• On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors
• Engineering Hybrid DenseZDDs
• Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances
• Tractable Pathfinding for the Stochastic On-Time Arrival Problem
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
• Experimental Analysis of Algorithms for Coflow Scheduling
• An Empirical Study of Online Packet Scheduling Algorithms
• Advanced Multilevel Node Separator Algorithms
• A merging heuristic for the rectangle decomposition of binary matrice
• CHICO: A Compressed Hybrid Index for Repetitive Collections
• Fast Scalable Construction of (Minimal Perfect Hash) Functions
• Better partitions of protein graphs for subsystem quantum chemistry
• Online Algorithm for Approximate Quantile Queries on Sliding Windows.

Other Format:

Printed edition:

ISBN:

• 978-3-319-38851-9
• 9783319388519

Access Restriction:

Restricted for use by site license.