Talks & Seminars
Title: Algorithms for Complex Problems
Prof. Sandor Fekete, TU Braunschweig
Date & Time: February 12, 2013 17:15
Venue: Room # SIC 301, 03rd Floor, C Block, Department of Computer Science and Engineering, Kanwal Rekhi Building
Many algorithmic problems make it difficult to develop “ideal” algorithms that can (1) always; (2) quickly; compute (3) an optimal solution. In the first part of the talk I will focus on the Traveling Salesman Problem to illustrate the possible ways of dealing with these difficulties. This will be followed by a study of the quest for longest tours, showing how the geometry of involved structures can have dramatic implications for problem complexity. In the second half of the talk, I will consider complex problems of a different kind. Computation in our modern world has become more and more decentralized, implying that we are no longer dealing with algorithmic problems handled by *one* central processor, but by many entities that cooperate in carrying out complex computations; crucial aspects are the locality of information, computation, and interaction. As a consequence, we are faced with fundamental problems that combine algorithmic challenges with aspects of parallel computing, optimization with limited information and even computer architecture. I will present algorithmic results for geometric problems related to computational geometry and computer vision. In the end I will show a number of other related problems and projects. This talk does not require any prior knowledge, and participants are encouraged to ask questions. The speaker has plenty of time for followup discussions.
Speaker Profile:
Sándor Fekete studied mathematics and physics at the University of Cologne, before getting his Ph.D. in Combinatorics and Opimization from the University of Waterloo, Canada (1992). After spending a year as a postdoc at SUNY Stony Brook with 2010 Gödel Prize winner Joe Mitchell, he returned to Cologne, where he got his habilation in mathematics (1998) and joined the optimization group at TU Berlin. In 2001, he became a professor of mathematics at TU Braunschweig; since 2007 he holds a newly founded chair for algorithmics in the Computer Science Department, where he became Department Chair in 2009, and Director of the interdisciplinary research center tubs.CITY in 2011. Sándor has published over 200 papers with more than 180 coauthors; his interests range all the way from theoretical foundations of algorithms and optimization to applications areas such as practical computer science, electrical engineering, economics, biology, and physics.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback