Campus Event Calendar
Event Entry
What and Who
NP-hard Networking Problems - Exact and Approximate Algorithms
Rouven Naujoks
Max-Planck-Institut für Informatik - D1
Promotionskolloquium
AG 1
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 22 December 2008
14:00
60 Minutes
E1 4
024
Saarbrücken
Abstract
An important class of problems that occur in different fields of research deal with the problem of finding an interconnection of a given set of objects.
In this talk we discuss NP-hard problems of that kind, such as the exact computation of Steiner minimum trees in Hamming metric and approximation algorithms for power assignment problems occurring in the design of wireless communication networks.
Contact
Rouven Naujoks
--email hidden
passcode not visible
logged in users only
Rouven Naujoks, 12/18/2008 23:07 -- Created document.