{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:43Z","timestamp":1761621043940},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161070"},{"type":"electronic","value":"9783642161087"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_12","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T08:58:37Z","timestamp":1283245117000},"page":"104-118","source":"Crossref","is-referenced-by-count":14,"title":["Inferring Social Networks from Outbreaks"],"prefix":"10.1007","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[]},{"given":"Lev","family":"Reyzin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Tamura, T., Horimoto, K.: Completing networks using observed data. In: ALT, pp. 126\u2013140 (2009)","DOI":"10.1007\/978-3-642-04414-4_14"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S0895480103431071","volume":"18","author":"N. Alon","year":"2005","unstructured":"Alon, N., Asodi, V.: Learning a hidden subgraph. SIAM J. Discrete Math.\u00a018(4), 697\u2013712 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: Proceedings of the 35th annual ACM symposium on Theory of computing, pp. 100\u2013105 (2003)","DOI":"10.1145\/780542.780558"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: STOC, pp. 100\u2013105 (2003)","DOI":"10.1145\/780542.780558"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. ACM Transactions on Algorithms\u00a02(4), 640\u2013660 (2006)","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/S0097539702420139","volume":"33","author":"N. Alon","year":"2004","unstructured":"Alon, N., Beigel, R., Kasif, S., Rudich, S., Sudakov, B.: Learning a hidden matching. SIAM J. Comput.\u00a033(2), 487\u2013501 (2004)","journal-title":"SIAM J. Comput."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Reyzin, L.: Optimally learning social networks with activations and suppressions. In: 19th International Conference on Algorithmic Learning Theory, pp. 272\u2013286 (2008)","DOI":"10.1007\/978-3-540-87987-9_24"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Chen, J.: Learning a hidden graph using O(logn) queries per edge. J. Comput. Syst. Sci.\u00a074(4), 546\u2013556 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Beigel, R., Alon, N., Kasif, S., Apaydin, M.S., Fortnow, L.: An optimal procedure for gap closing in whole genome shotgun sequencing. In: RECOMB, pp. 22\u201330 (2001)","DOI":"10.1145\/369133.369152"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Buchbinder, N.: Designing Competitive Online Algorithms Via A Primal-Dual Approach. PhD thesis, Technion \u2013 Israel Institute of Technology, Haifa, Israel (2008)","DOI":"10.1561\/9781601982179"},{"key":"12_CR12","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci.\u00a05, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"1-3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V. Grebinski","year":"1998","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping. Discrete Applied Mathematics\u00a088(1-3), 147\u2013165 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Ravi, R.: Online and stochastic survivable network design. In: STOC, pp. 685\u2013694 (2009)","DOI":"10.1145\/1536414.1536507"},{"issue":"1-3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10107-003-0410-x","volume":"98","author":"E. Korach","year":"2003","unstructured":"Korach, E., Stern, M.: The clustering matroid and the optimal clustering tree. Mathematical Programming\u00a098(1-3), 345\u2013414 (2003)","journal-title":"Mathematical Programming"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.dam.2006.12.004","volume":"156","author":"E. Korach","year":"2008","unstructured":"Korach, E., Stern, M.: The complete optimal stars-clustering-tree problem. Discrete Applied Mathematics\u00a0156(4), 444\u2013450 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-75225-7_24","volume-title":"Algorithmic Learning Theory","author":"L. Reyzin","year":"2007","unstructured":"Reyzin, L., Srivastava, N.: Learning and verifying graphs using queries with a focus on edge counting. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol.\u00a04754, pp. 285\u2013297. Springer, Heidelberg (2007)"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02(4), 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:22:20Z","timestamp":1619770940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}