Campus Event Calendar
Event Entry
What and Who
Approximation in Network Design
Edda Happ
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 12 January 2006
13:00
-- Not specified --
45 - FR 6.2 (E1 3)
016
Saarbrücken
Abstract
In the Virtual Private Network Design (VPND) Problem we are given an
undirected graph G=(V,E) with edge costs c and a subset T of the
vertices that wish to communicate. The aim is to reserve capacities on
the edges such that this communictation can be guaranteed.
We consider different variants of this problem and possible
approximation algorithms to solve them.
undirected graph G=(V,E) with edge costs c and a subset T of the
vertices that wish to communicate. The aim is to reserve capacities on
the edges such that this communictation can be guaranteed.
We consider different variants of this problem and possible
approximation algorithms to solve them.
Contact
--email hidden
passcode not visible
logged in users only
Veronika Weinand, 01/09/2006 15:14
Veronika Weinand, 10/19/2005 13:11
Veronika Weinand, 10/19/2005 13:08 -- Created document.
Veronika Weinand, 10/19/2005 13:11
Veronika Weinand, 10/19/2005 13:08 -- Created document.