default search action
Algorithm Engineering 2016
- Lasse Kliemann, Peter Sanders:
Algorithm Engineering - Selected Results and Surveys. Lecture Notes in Computer Science 9220, 2016, ISBN 978-3-319-49486-9 - Adrian Balint, Uwe Schöning:
Engineering a Lightweight and Efficient Local Search SAT Solver. 1-18 - Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. 19-80 - Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the k-Means Algorithm - A Survey. 81-116 - Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. 117-158 - Benjamin Doerr, Magnus Wahlström:
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them. 159-184 - Stefan Edelkamp:
External-Memory State Space Search. 185-225 - Matthias Fischer, Claudius Jähn, Friedhelm Meyer auf der Heide, Ralf Petring:
Algorithm Engineering Aspects of Real-Time Rendering Algorithms. 226-244 - Marc Goerigk, Anita Schöbel:
Algorithm Engineering in Robust Optimization. 245-279 - Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Clustering Evolving Networks. 280-329 - Wiebke Höhn, Rolf H. Möhring:
Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications. 330-351 - Lasse Kliemann:
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model. 352-378 - Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. 379-417
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.