Campus Event Calendar
Event Entry
What and Who
Computing Steiner Minimum Trees in Hamming Metric
Rouven Naujoks
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 3
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 19 January 2006
13:30
30 Minutes
Warning: Time has changed!
46.1 - MPII
024
Saarbrücken
Abstract
Computing Steiner minimum trees in Hamming metric is a well studied problem that has applications in several fields of science such as computational linguistics and computational biology. Among all methods for finding such trees, algorithms using variations of a branch and bound method developed by Penny and Hendy have been the fastest for more than 20 years. In this talk we describe a new pruning approach.
This talk is a preliminary talk for SODA 2006. This is a joint work with Ernst Althaus.
Contact
Rouven Naujoks
0681 9325 128
--email hidden
passcode not visible
logged in users only
Rouven Naujoks, 01/17/2006 12:20
Rouven Naujoks, 01/16/2006 16:56
Rouven Naujoks, 01/16/2006 16:55 -- Created document.
Rouven Naujoks, 01/16/2006 16:56
Rouven Naujoks, 01/16/2006 16:55 -- Created document.