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, February 10, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Christoph Ambühl (Istituto Dalle Molle di Studi sull' Intelligenza Artificiale, Lugano)

Minimum spanning trees in the unit disk

Let S be any point set which

Let T be the Euclidean minimum spanning tree of S. I will sketch a proof that the sum of the squared edge lengths of T is always bounded by 6.

This problem originates from the analysis of an algorithm to compute an energy efficient broadcast tree in wireless networks.


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