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

Mittagsseminar Talk Information

Date and Time: Tuesday, April 08, 2025, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Philip Whittington

Time-Optimal k-Server

A set of servers is positioned in a metric space. One by one, points in the metric space are requested. For each request, one of the servers needs to move to this point to serve the request, paying a cost for the distance travelled. How can we efficiently move the servers without knowing the future requests? This is the k-Server problem, a fundamental problem in the field of Online Algorithms. In this talk, I will present the historical and ongoing research on this problem, and introduce a new variant in which servers are allowed to move in parallel without incurring additional cost.


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

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