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: Wednesday, February 22, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Satoru Iwata (Tokyo University)

Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems

In this talk, we present an efficient algorithm for minimizing a certain class of submodular functions that arise in analysis of multiclass queueing systems. In particular, the algorithm can be used for testing whether a given multiclass M/M/1 system achieves a required average performance by an appropriate control policy. With the aid of the topological sweeping method for line arrangement, our algorithm runs in O(n2) time, where n is the cardinality of the ground set. This is much faster than direct applications of general submodular function minimization algorithms.

This is a joint work with Toshinari Itoko.

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