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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Monday, January 16, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Kiyohito Nagano (Univ. of Tokyo)

A strongly polynomial algorithm for line search in submodular polyhedra

Submodularity plays an important role in combinatorial optimization. A submodular polyhedron (or an extended polymatroid) is a polyhedron associated with a submodular set function. In this talk, we consider a line search problem in a submodular polyhedron, which is a generalization of submodular function minimization and a fair maximum flow problem. We present a first strongly polynomial time algorithm for this problem with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.


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

Previous talks by year:   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