Final Theses
with string, integer, and 2-Motzkin path representations, with the last proven most efficient. We computed new improved lower bounds for simple (Ω(2.4312 n )) and Hamiltonian (Ω(2.0886 n )) cycles using the [...] the tour, which allows for a more efficient search for improving 2-OPT moves. The algorithm needs O(n 2 ) time preprocessing and O(n 2 ) storage space. In this thesis the theoretical runtimes of the new [...] If you plan to write your BSc thesis in our group, you should have successfully completed DAP2, GTi, MafI 1+2 , and at least one (but ideally several) of the advanced courses offered by our group: Efficient …
