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: Tuesday, October 25, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Yves Brise

Range Assignment Problems

The past decade has been active in what I like to call range assignment problems. Consider a set of points P in the plane, and imagine them as senders/receivers in a network. If you assign radii to each of these senders, and assume that a sender is able to send that far, what you get is a geometric connection graph on the points in P. One can now impose different properties on this graph, the most natural of which is probably that it should be strongly connected. Your range assignment should try to minimize some function of the radii while still maintaining that property. There are several parameters in this problem, and also a lot of variants, considering slightly different settings or generalizations. I'm going to try to give an overview of the results and techniques in this field. That includes settled cases, approximations, and hardness results.

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