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

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

Randomised roundings on hypergraphs

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?

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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