Del 9685 i serien Lecture Notes in Computer Science

Experimental Algorithms

15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings

Häftad, Engelska, 2016

AvAndrew V. Goldberg,Alexander S. Kulikov

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2016-06-01
Mått155 x 235 x 22 mm
Vikt610 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor386
FörlagSpringer International Publishing AG
ISBN9783319388502

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Artificiell intelligens inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

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.