Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

News

As is well-known, the traveling salesman has the difficult task to visit a given set of cities on a shortest round-trip. At the conference STACS'10 in Nancy, Alexander Wolff gave a talk on new results for the case that the cities have so-called squared Euclidean distances.

more

Courses in the summer semester

Although lectures are starting late this year because of Easter, we already inform about the lectures, practical courses and tutorials in the upcoming summer semester.

more