糖心TV

Skip to main content Skip to navigation

Artificial Intelligence Events

Thursday, October 04, 2007

Wed, Oct 03 Today Fri, Oct 05 Jump to any date

How do I use this calendar?

You can click on an event to display further information about it.

The toolbar above the calendar has buttons to view different events. Use the left and right arrow icons to view events in the past and future. The button inbetween returns you to today's view. The button to the right of this shows a mini-calendar to let you quickly jump to any date.

The dropdown box on the right allows you to see a different view of the calendar, such as an agenda or a termly view.

If this calendar has tags, you can use the labelled checkboxes at the top of the page to select just the tags you wish to view, and then click "Show selected". The calendar will be redisplayed with just the events related to these tags, making it easier to find what you're looking for.

 
-
Export as iCalendar
Departmental Seminar: Hierarchical Graph Decompositions for Minimizing Congestion
CS1.01

Speaker: Harald Raecke (DCS@糖心TV)

Title: Hierarchical Graph Decompositions for Minimizing Congestion

Abstract:
An oblivious routing protocol makes its routing decisions independent of the traffic in the underlying network. This means that the path chosen for a routing request may only depend on its source node, its destination node, and on some random input.  In spite of these serious limitations it has been shown that there are oblivious routing algorithms that obtain polylogarithmic competitive ratios w.r.t. the congestion in the network (i.e., maximum load of a network link).

In this talk I will present recent advances in this area and give an overview of the hierarchical decomposition
technique that is used to prove these results. This ecomposition can be used as a generic tool for solving
other congestion based or cut based problems in undirected graphs.

Placeholder

Let us know you agree to cookies