Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Thursday, March 11, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Jan Remy

Online Construction of Minimum Spanning Trees in Random Weighted Graphs

In this talk an online variant of the minimum spanning tree problem in random weighted graphs will be presented. We assume that the input graph is complete and the edge weights have uniform distribution over [0,1]. An algorithm receives the edges one by one in random order and has to decide immediately whether to include the current edge into the spanning tree or to reject it. As a performance measure we consider the expected competitive ratio E[r], where r=ALG/OPT. As our main result, we propose an online algorithm and show that its expected competitive ratio is O(1).

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

Previous talks by year:   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