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: Thursday, July 18, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Julia Pap

Complexity of Hilbert bases, TDL-ness and g-polymatroids

A usual type of question in combinatorial optimization is to give the defining linear system of a certain class of combinatorially defined polytopes. The properties of the defining linear system tell us a lot about the tractability and structure of the problem. In my talk we consider questions from a different point of view: given a linear system can we decide whether it has a certain nice property?

We examine several properties of polyhedra from this computational point of view. First we consider total dual integrality and the related notion of Hilbert bases, which turn out to be co-NP-complete. On the other hand, it can be decided in polynomial time whether a system describes a generalized polymatroid, which is a broad class of "tractable" polyhedra. A related notion that we call total dual laminarity is in contrast NP-hard.


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