Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 28, 2010, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Jan Foniok
Consider a hypergraph with maximum degree d. Whenever there are real weights on the vertices, it is possible to round them so that the sum on any edge changes by at most d-1 (proved by Beck and Fiala many years ago). Anna Huber proves in her dissertation that it is also possible to do in a randomised way (so that the expected rounded weight on each vertex is equal to the original weight), but with the sum of weights on an edge changing by at most d. Is it possible to achieve d-1 in this case, too?
Automatic MiSe System Software Version 1.4803M | admin login