Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithms

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Andrew V. Goldberg

    1. Amazon.com, Inc., Palo Alto, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Alexander S. Kulikov

    1. Russian Academy of Sciences, St. Petersburg, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9685)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SEA 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 papers)

  1. Front Matter

    Pages I-XVI
    Download chapter PDF

  2. Practical Variable Length Gap Pattern Matching

    • Johannes Bader, Simon Gog, Matthias Petri
    Pages 1-16

  3. Fast Exact Computation of Isochrones in Road Networks

    • Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner
    Pages 17-32

  4. Dynamic Time-Dependent Route Planning in Road Networks with User Preferences

    • Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner
    Pages 33-49

  5. UKP5: A New Algorithm for the Unbounded Knapsack Problem

    • Henrique Becker, Luciana S. Buriol
    Pages 50-62

  6. Lempel-Ziv Decoding in External Memory

    • Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
    Pages 63-74

  7. A Practical Method for the Minimum Genus of a Graph: Models and Experiments

    • Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbčík
    Pages 75-88

  8. Compact Flow Diagrams for State Sequences

    • Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben
    Pages 89-104

  9. Practical Dynamic Entropy-Compressed Bitvectors with Applications

    • Joshimar Cordova, Gonzalo Navarro
    Pages 105-117

  10. Accelerating Local Search for the Maximum Independent Set Problem

    • Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
    Pages 118-133

  11. Computing Nonsimple Polygons of Minimum Perimeter

    • Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke et al.
    Pages 134-149

  12. Sparse Subgraphs for 2-Connectivity in Directed Graphs

    • Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
    Pages 150-166

  13. Worst-Case-Efficient Dynamic Arrays in Practice

    • Jyrki Katajainen
    Pages 167-183

  14. On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors

    • Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias
    Pages 184-200

  15. Engineering Hybrid DenseZDDs

    • Taito Lee, Shuhei Denzumi, Kunihiko Sadakane
    Pages 201-216

  16. Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances

    • Stephan S. Lorenzen, Pawel Winter
    Pages 217-230

  17. Tractable Pathfinding for the Stochastic On-Time Arrival Problem

    • Mehrdad Niknami, Samitha Samaranayake
    Pages 231-245

  18. An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem

    • Matthias Poloczek, David P. Williamson
    Pages 246-261

  19. Experimental Analysis of Algorithms for Coflow Scheduling

    • Zhen Qiu, Clifford Stein, Yuan Zhong
    Pages 262-277

  20. An Empirical Study of Online Packet Scheduling Algorithms

    • Nourhan Sakr, Cliff Stein
    Pages 278-293
Back to top

Other volumes

  1. Experimental Algorithms

Keywords

About this book

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.

Editors and Affiliations

  • Amazon.com, Inc., Palo Alto, USA

    Andrew V. Goldberg

  • Russian Academy of Sciences, St. Petersburg, Russia

    Alexander S. Kulikov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation