Deutsch Intern
    Chair of Computer Science I - Algorithms, Complexity, and Knowledge-Based Systems

    Location problems deal with the choice of locations for facilities that are to be opened. At the conference ISAAC'10, Joachim Spoerhase presents an optimal algorithm for the so-called single maximum coverage location problem on tree-graphs.

    more

    Public Defense

    06/14/2010

    Joachim Spoerhase, research assistant at the Chair of Computer Science I, defends his dissertation on competitive and voting location.

    more

    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

    We are pleased to offer free trials to Cambridge Books Online, and to the e-book collection published by Brill. Your feedback will influence our purchase decision!

    more

    We are pleased to offer free trials to Cambridge Books Online, and to the e-book collection published by Brill. Your feedback will influence our purchase decision!

    more

    We are pleased to offer free trials to Cambridge Books Online, and to the e-book collection published by Brill. Your feedback will influence our purchase decision!

    more

    We are pleased to offer free trials to Cambridge Books Online, and to the e-book collection published by Brill. Your feedback will influence our purchase decision!

    more

    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
    Contact

    Lehrstuhl für Informatik I (Effiziente Algorithmen und wissensbasierte Systeme)
    Am Hubland
    97074 Würzburg

    Phone: +49 931 31-85054
    Email

    Find Contact

    Hubland Süd, Geb. Z8 Hubland Süd, Geb. M2