Approximating the online set multicover problems via randomized winnowing

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 110-121

  Berman, Piotr ^a   DasGupta, Bhaskar ^b  

^a The Pennsylvania State University   (United States)

^b University of Illinois at Chicago   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

ONLINE SET MULTICOVER PROBLEMS; RANDOMIZED WINNOWING;

SET THEORY;

EID: 26844438073     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_11     Document Type: Conference Paper

References (16)

1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. The online set cover problem, 35th annual ACM Symposium on the Theory of Computing, pp. 100-105, 2003.
2. M. Andrec, B.N. Kholodenko, R.M. Levy, and E.D. Sontag. Inference of signaling and gene regulatory networks by steady-state perturbation experiments: Structure and accuracy, J. Theoretical Biology, in press.
3. B. Awerbuch, Y. Azar, A. Fiat and T. Leighton. Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time, 28th annual ACM Symposium on the Theory of Computing, pp. 519-530, 1996.
4. P. Berman, B. DasGupta and E. Sontag. Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks, to appear in the special issue of Discrete Applied Mathematics on computational biology (the conference version in 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, LNCS 3122, K. Jansen, S. Khanna, J. D. P. Rolim and D. Ron (editors), Springer Verlag, pp. 39-50, August 2004).
5. H. Chernoff. A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics, 23: 493-509, 1952.
6. E.J. Crampin, S. Schnell, and P.E. McSharry. Mathematical and computational techniques to deduce complex biochemical reaction mechanisms, Progress in Biophysics & Molecular Biology, 86, pp. 77-112, 2004.
7. U. Feige. A threshold for approximating set cover, Journal of the ACM, Vol. 45, 1998, pp. 634-652.
8. D. S. Johnson. Approximation Algorithms for Combinatorial Problems, Journal of Computer and Systems Sciences, Vol. 9, 1974, pp. 256-278.
9. B. N. Kholodenko, A. Kiyatkin, F. Bruggeman, E.D. Sontag, H. Westerhoff, and J. Hoek. Untangling the wires: a novel strategy to trace functional interactions in signaling and gene networks, Proceedings of the National Academy of Sciences USA 99, pp. 12841-12846, 2002.
10. B. N. Kholodenko and E.D. Sontag. Determination of functional network structure from local parameter dependence data, arXiv physics/0205003, May 2002.
11. N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Machine Learning, 2, pp. 285-318, 1988.
12. R. Motwani and P. Raghavan. Randomized Algorithms, Cambridge University Press, New York, NY, 1995.
13. R. Raz and S. Safra. A sub-constant error-probability low-degre test and sub-constant error-probability PCP characterization of NP, proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 475-484, 1997.
14. E.D. Sontag, A. Kiyatkin, and B.N. Kholodenko. Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data, Bioinformatics 20, pp. 1877-1886, 2004.
15. J. Stark, R. Callard and M. Hubank. From the top down: towards a predictive biology of signaling networks, Trends Biotechnol. 21, pp. 290-293, 2003.
16. V. Vazirani. Approximation Algorithms, Springer-Verlag, July 2001.