{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:28Z","timestamp":1725549688319},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_11","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"110-121","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Online Set Multicover Problems via Randomized Winnowing"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaskar","family":"DasGupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: 35th annual ACM Symposium on the Theory of Computing, pp. 100\u2013105 (2003)","DOI":"10.1145\/780542.780558"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Andrec, M., Kholodenko, B.N., Levy, R.M., Sontag, E.D.: Inference of signaling and gene regulatory networks by steady-state perturbation experiments: Structure and accuracy. J. Theoretical Biology (in press)","DOI":"10.1016\/j.jtbi.2004.08.022"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Fiat, A., Leighton, T.: Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time. In: 28th annual ACM Symposium on the Theory of Computing, pp. 519\u2013530 (1996)","DOI":"10.1145\/237814.238000"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 39\u201350. Springer, Heidelberg (2004) (to appear)","DOI":"10.1007\/978-3-540-27821-4_4"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics\u00a023, 493\u2013509 (1952)","journal-title":"Annals of Mathematical Statistics"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.pbiomolbio.2004.04.002","volume":"86","author":"E.J. Crampin","year":"2004","unstructured":"Crampin, E.J., Schnell, S., McSharry, P.E.: Mathematical and computational techniques to deduce complex biochemical reaction mechanisms. Progress in Biophysics & Molecular Biology\u00a086, 77\u2013112 (2004)","journal-title":"Progress in Biophysics & Molecular Biology"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and Systems Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kholodenko, B.N., Kiyatkin, A., Bruggeman, F., Sontag, E.D., Westerhoff, H., Hoek, J.: Untangling the wires: a novel strategy to trace functional interactions in signaling and gene networks. In: Proceedings of the National Academy of Sciences, USA, vol.\u00a099, pp. 12841\u201312846 (2002)","DOI":"10.1073\/pnas.192442699"},{"key":"11_CR10","unstructured":"Kholodenko, B.N., Sontag, E.D.: Determination of functional network structure from local parameter dependence data, arXiv physics\/0205003 (May 2002)"},{"key":"11_CR11","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm. Machine Learning\u00a02, 285\u2013318 (1988)","journal-title":"Machine Learning"},{"key":"11_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degre test and sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1093\/bioinformatics\/bth173","volume":"20","author":"E.D. Sontag","year":"2004","unstructured":"Sontag, E.D., Kiyatkin, A., Kholodenko, B.N.: Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data. Bioinformatics\u00a020, 1877\u20131886 (2004)","journal-title":"Bioinformatics"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/S0167-7799(03)00140-9","volume":"21","author":"J. Stark","year":"2003","unstructured":"Stark, J., Callard, R., Hubank, M.: From the top down: towards a predictive biology of signaling networks. Trends Biotechnol.\u00a021, 290\u2013293 (2003)","journal-title":"Trends Biotechnol."},{"key":"11_CR16","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:50Z","timestamp":1605643790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11534273_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}