Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, August 11, 2011, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Shakhar Smorodinsky (Ben-Gurion University)
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
Automatic MiSe System Software Version 1.4803M | admin login