Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 39-50

  Berman, Piotr ^a   DasGupta, Bhaskar ^b   Sontag, Eduardo ^c  

^a The Pennsylvania State University   (United States)

^b University of Illinois at Chicago   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GENES; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROTEINS; REVERSE ENGINEERING;

APPROXIMATION RATIOS; COMBINATORIAL PROBLEM; GREEDY ALGORITHMS; INCREASING FUNCTIONS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RANDOMIZED ALGORITHMS; RANDOMIZED APPROXIMATION; RANDOMIZED ROUNDING;

APPROXIMATION ALGORITHMS;

EID: 35048887511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_4     Document Type: Article

References (15)

1. N. Alon and J. Spencer, The Probabilistic Method, Wiley Interscience, New York, 1992.
2. 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.
3. T. Cover, Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition, IEEE Trans. Electronic Computers EC-14, pp. 326-334, 1965.
4. Reprinted in Artificial Neural Networks: Concepts and Theory, IEEE Computer Society Press, Los Alamitos, Calif., 1992, P. Mehra and B. Wah, eds.
5. U. Feige. A threshold for approximating set cover, JACM, Vol. 45, 1998, pp. 634-652.
6. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., 1979.
7. D. S. Johnson. Approximation Algorithms for Combinatorial Problems, Journal of Computer and Systems Sciences, Vol. 9, 1974, pp. 256-278.
8. N. Karmarkar. A new polynomial-time algorithm for linear programming, Combinatorica, 4: 373-395, 1984.
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. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, NY, 1995.
12. L. Schläfli, Theorie der vielfachen Kontinuitat (1852), in Gesammelte Mathematische Abhandlungen, volume 1, pp. 177-392, Birkhäuser, Basel, 1950.
13. E. D. Sontag, VC dimension of neural networks, in Neural Networks and Machine Learning (C.M. Bishop, ed.), Springer-Verlag, Berlin, pp. 69-95, 1998.
14. 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.
15. V. Vazirani. Approximation Algorithms, Springer-Verlag, July 2001.