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, August 11, 2011, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Shakhar Smorodinsky (Ben-Gurion University)

Hitting Sets Online and Vertex Ranking

We consider the problem of hitting sets online for several families of hypergraphs.
We show that for such hypergraphs, the competitive ratio of the online hitting set problem
equals a certain chromatic number of the hypergraph known as the unique-maximum (um) chromatic number.
Joint work with Guy Even


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