Books+ Search Results
2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)
Title
2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) / Stephen Kobourov and Henning Meyerhenke.
ISBN
9781611975499
Publication
Philadelphia, Pennsylvania : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), [2019]
Physical Description
PDFs (225 pages) : illustrations
Local Notes
Access is available to the Yale community.
Notes
Title from title screen (viewed June 17, 2019).
Access and use
Access restricted by licensing agreement.
Summary
The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice.
Variant and related titles
Thumbnail on website: ALENEX19 : Meeting on Algorithm Engineering & Experiments, January 7-8, 2019, Westin San Diego, San Diego, California, USA.
SIAM ebooks.
Format
Books / Online
Language
English
Added to Catalog
April 16, 2021
Bibliography
Includes bibliographical references.
Contents
Worst-case efficient sorting with QuickMergeSort / Stefan Edelkamp and Armin Wei
Simple and fast BlockQuicksort using Lomuto's partitioning scheme / Martin Aumüller and Nikolaj Hass
Lightweight distributed suffix array construction / Johannes Fischer and Florian Kurpicz
Approximation of trees by self-nested trees / Romain Azaïs, Jean-Baptiste Durand, and Christophe Godin
Fast and exact public transit routing with restricted Pareto sets / Daniel Delling, Julian Dibbelt, and Thomas Pajor
Alternative multicriteria routes / Florian Barth, Stefan Funke, and Sabine Storandt
Concatenated k-path covers / Moritz Beck, Kam-Yiu Lam, Joseph Kee Yin Ng, Sabine Storandt, and Chun Jiang Zhu
Batch-parallel Euler tour trees / Thomas Tseng, Laxman Dhulipala, and Guy Blelloch
A new integer linear program for the Steiner tree problem with revenues, budget and hop constraints / Adalat Jabrayilov and Petra Mutzel
SAT-Encodings for treecut width and treedepth / Robert Ganian, Neha Lodha, Sebastian Ordyniak, and Stefan Szeider
Efficiently enumerating hitting sets of hypergraphs arising in data profiling / Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, and Martin Schirneck
Exactly solving the maximum weight independent set problem on large real-world graphs / Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, and Huashuo Zhang
Parallel range, segment and rectangle queries with augmented maps / Yihan Sun and Guy E. Blelloch
A practical algorithm for spatial agglomerative clustering / Thom Castermans, Bettina Speckman, and Kevin Verbeek
Practical methods for computing large covering tours and cycle covers with turn cost / Sándor P. Fekete and Dominik Krupke
Faster support vector machines / Sebastian Schlag, Matthias Schmitt, and Christian Schulz
Scalable edge partitioning / Sebastian Schlag, Christian Schulz, Daniel Seemaier, and Darren Strash.
Publisher's number
PRAL19 SIAM
Subjects
Also listed under
Bookmark As
Citation
