UID:
almahu_9949434970202882
Format:
PDFs (iii, 220 pages) :
,
illustrations
ISBN:
9781611977042
Content:
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 results include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. ALENEX papers also address methodological issues and standards in the experimental evaluation of algorithms and data structures. Relevant areas of applied algorithmic research include but are not limited to databases; geometry; graphs and networks, including web applications; operations research; combinatorial aspects of scientific computing; and computational problems in the natural sciences or engineering. ALENEX also regularly welcomes papers 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 high-performance and cloud computing.
Note:
Distance closures : unifying search- and lookup-based shortest path speedup techniques / Daniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl -- Practical fully dynamic minimum cut algorithms / Monika Henzinger, Alexander Noe, Christian Schulz -- Engineering uniform sampling of graphs with a prescribed power-law degree sequence / Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald -- Effective data reduction for the vertex clique cover problem / Darren Strash, Louise Thompson -- McSparse : exact solutions of sparse maximum cut and sparse unconstrained binary quadratic optimization problems / Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel -- A SAT approach to twin-width / André Schidler, Stefan Szeider -- Computing graph hyperbolicity using dominating sets / David Coudert, André Nusser, Laurent Viennot -- Towards the 5/6-density conjecture of pinwheel scheduling / Leszek Gąsieniec, Benjamin Smith, Sebastian Wild -- Load balancing : the long road from theory to practice / Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder -- Efficient access history for race detection / Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl -- Shared-memory N-level hypergraph partitioning / Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag -- Fast multimodal journey planning for three criteria / Moritz Potthoff, Jonas Sauer -- Perturbation analysis of practical algorithms for the maximum scatter travelling salesman problem -- Emil Biju, Sundar Raman P. -- Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification / Tamal K. Dey, Simon Zhang -- Learning to prune instances of k-median and related problems / Dena Tayebi, Saurabh Ray, Deepak Ajwani -- Parallel nearest neighbors in low dimensions with batch updates / Guy E. Blelloch, Magdalen Dobson -- An efficient branch-and-bound solver for hitting set / Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Language:
English
DOI:
10.1137/1.9781611976472
Bookmarklink