Publications
Publications
Author:  
All :: A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z 
All :: Earle, ... , Engel, Englert, Engwer, ... , Eyraud-Loisel 
References
6.
Matthias Englert, Heiko Röglin and Berthold Vöcking
Smoothed analysis of the 2-opt algorithm for the general TSP
ACM Trans. Algorithms, 13(1):Art. 10, 15
2016
5.
Matthias Englert, Heiko Röglin and Berthold Vöcking
Worst case and probabilistic analysis of the 2-opt algorithm for the TSP
Algorithmica, 68(1):190--264
2014
4.
Matthias Englert, Heiko Röglin, Jacob Spönemann and Berthold Vöcking
Economical caching
ACM Trans. Comput. Theory, 5(2):Art. 4, 21
2013
3.
Matthias Englert, Heiko Röglin and Matthias Westermann
Evaluation of online strategies for reordering buffers
ACM J. Exp. Algorithmics, 14:Article 3.3, 14
2009
2.
Matthias Englert, Heiko Röglin, Jacob Spönemann and Berthold Vöcking
Economical caching
STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science Volume 3 of LIPIcs. Leibniz Int. Proc. Inform.
page 385--396.
Publisher: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2009
1.
Matthias Englert, Heiko Röglin and Berthold Vöcking
Worst case and probabilistic analysis of the 2-opt algorithm for the TSP (extended abstract)
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms , page 1295--1304.
Publisher: ACM, New York,
2007
Export as:
BibTeX, XML