This book constitutes the refereed proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, SEA 2009, held in Dortmund, Germany, in June 2009.
The 23 revised full papers were carefully reviewed and selected from 64 submissions and present current research on experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-) heuristics, or application-driven case studies that deepen the understanding of a problem's complexity.
Author(s): Heinz Bast (auth.), Jan Vahrenhold (eds.)
Series: Lecture Notes in Computer Science 5526 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2009
Language: English
Pages: 293
Tags: Algorithm Analysis and Problem Complexity; Algorithms; Data Structures, Cryptology and Information Theory; Logics and Meanings of Programs; Discrete Mathematics in Computer Science; Performance and Reliability
Front Matter....Pages -
Parallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algorithms....Pages 1-1
From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering....Pages 2-2
Experimental Comparisons of Derivative Free Optimization Algorithms....Pages 3-15
On Computational Models for Flash Memory Devices....Pages 16-27
Competitive Buffer Management with Stochastic Packet Arrivals....Pages 28-39
Fast and Accurate Bounds on Linear Programs....Pages 40-50
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study....Pages 51-62
Rotated-Box Trees: A Lightweight c -Oriented Bounding-Volume Hierarchy....Pages 63-75
psort , Yet Another Fast Stable Sorting Software....Pages 76-88
A Heuristic for Fair Correlation-Aware Resource Placement....Pages 89-100
Measuring the Similarity of Geometric Graphs....Pages 101-112
A Heuristic Strong Connectivity Algorithm for Large Graphs....Pages 113-124
Pareto Paths with SHARC....Pages 125-136
An Application of Self-organizing Data Structures to Compression....Pages 137-148
Scheduling Additional Trains on Dense Corridors....Pages 149-160
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays....Pages 161-172
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games....Pages 173-184
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b -Matching....Pages 185-196
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow....Pages 197-208
Univariate Algebraic Kernel and Application to Arrangements....Pages 209-220
Fast Algorithm for Graph Isomorphism Testing....Pages 221-232
Algorithms and Experiments for Clique Relaxations—Finding Maximum s -Plexes....Pages 233-244
A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs....Pages 245-256
Multi-level Algorithms for Modularity Clustering....Pages 257-268
Bulk-Insertion Sort: Towards Composite Measures of Presortedness....Pages 269-280
Computing Elevation Maxima by Searching the Gauss Sphere....Pages 281-292
Back Matter....Pages -
