Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Wednesday, November 24, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Yoshio Okamoto
Submodular functions play a fundamental role in combinatorial optimization, and also appear in seemingly unrelated areas such as information theory and game theory. Finding a set minimizing the value of a given submodular function is the most basic problem around submodular functions. In this talk, we will see the most basic ideas of some existing algorithms to minimize a submodular function. The talk is directed to a non-specialist of combinatorial optimization; It just assumes basic stuffs in discrete math.
Automatic MiSe System Software Version 1.4803M | admin login