Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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

Brief introduction to the submodular function minimization problem (Part II)

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login