| |
|
| |
|
Bhaskar DasGupta
University of Illinois at Chicago
Randimized Approximations for Offline and Online Set-multicover Problems
March 3, 2006 3:00pm
Abstract:
In this talk, I will describe randomized approximation algorithms for offline and (time permitting) online versions of set multicover problems that improve the previously best known expected approximation ratio and competitive ratio bounds as a function of the coverage factor.
As an illustration of its application to systems biology, I will show how our algorithms can be used to design experiments of approximately optimal costs for some seemingly unrelated reverse engineering problems of biological networks.
Very minimal knowledge of biology or control theory will be assumed for this talk.
(These are joint results with Piotr Berman and Eduardo Sontag)
If you have questions, or would like to meet the speaker, please contact Ponda at 4-1994 or pondabarnes@tti-c.org. For information on future TTI-C talks or events, please go to the TTI-C Events page.