{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:31:48Z","timestamp":1761489108156},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,24]],"date-time":"2013-03-24T00:00:00Z","timestamp":1364083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9603-2","type":"journal-article","created":{"date-parts":[[2013,3,23]],"date-time":"2013-03-23T10:01:25Z","timestamp":1364032885000},"page":"418-432","source":"Crossref","is-referenced-by-count":13,"title":["Network construction with subgraph connectivity constraints"],"prefix":"10.1007","volume":"29","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[]},{"given":"Lev","family":"Reyzin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,24]]},"reference":[{"issue":"4","key":"9603_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0895480103431071","volume":"18","author":"N Alon","year":"2005","unstructured":"Alon N, Asodi V (2005) Learning a hidden subgraph. SIAM J Discret Math 18(4):697\u2013712","journal-title":"SIAM J Discret Math"},{"key":"9603_CR2","doi-asserted-by":"crossref","unstructured":"Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2003) The online set cover problem. In: Proceedings of the 35th annual ACM symposium on theory of, computing, pp. 100\u2013105","DOI":"10.1145\/780542.780558"},{"issue":"4","key":"9603_CR3","doi-asserted-by":"crossref","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 (2006) A general approach to online network optimization problems. ACM Trans Algorithms 2(4):640\u2013660","journal-title":"ACM Trans Algorithms"},{"issue":"2","key":"9603_CR4","doi-asserted-by":"crossref","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 (2004) Learning a hidden matching. SIAM J Comput 33(2):487\u2013501","journal-title":"SIAM J Comput"},{"key":"9603_CR5","doi-asserted-by":"crossref","unstructured":"Angluin D, Aspne, J, Reyzin L (2008) Optimally learning social networks with activations and suppressions. In: 19th International conference on algorithmic learning theory, pp. 272\u2013286","DOI":"10.1007\/978-3-540-87987-9_24"},{"key":"9603_CR6","doi-asserted-by":"crossref","unstructured":"Angluin D, Aspnes J, Reyzin L (2010) Inferring social networks from outbreaks. In: 21st International conference on algorithmic learning theory, pp. 104\u2013118","DOI":"10.1007\/978-3-642-16108-7_12"},{"issue":"4","key":"9603_CR7","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"D Angluin","year":"2008","unstructured":"Angluin D, Chen J (2008) Learning a hidden graph using $$O(\\log n)$$ queries per edge. J Comput Syst Sci 74(4):546\u2013556","journal-title":"J Comput Syst Sci"},{"key":"9603_CR8","doi-asserted-by":"crossref","unstructured":"Beigel R, Alon N, Kasif S, Apaydin MS, Fortnow L (2001) An optimal procedure for gap closing in whole genome shotgun sequencing. In: RECOMB, pp. 22\u201330","DOI":"10.1145\/369133.369152"},{"issue":"3","key":"9603_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth KS, Lueker GS (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J Comput Syst Sci 13(3):335\u2013379","journal-title":"J Comput Syst Sci"},{"key":"9603_CR10","doi-asserted-by":"crossref","unstructured":"Buchbinder N (2008) Designing competitive online algorithms via a primal-dual approach. Ph.D. thesis, Technion\u2013Israel Institute of Technology, Haifa, Israel","DOI":"10.1561\/9781601982179"},{"key":"9603_CR11","doi-asserted-by":"crossref","unstructured":"Chockler G, Melamed R, Tock Y, Vitenberg R (2007) Constructing scalable overlays for pub-sub with many topics. In: PODC, pp. 109\u2013118","DOI":"10.1145\/1281100.1281118"},{"key":"9603_CR12","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17\u201361","journal-title":"Publ Math Inst Hung Acad Sci"},{"issue":"4","key":"9603_CR13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of ln for approximating set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"issue":"4","key":"9603_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/2086737.2086741","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. TKDD 5(4):21","journal-title":"TKDD"},{"issue":"1\u20133","key":"9603_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V Grebinski","year":"1998","unstructured":"Grebinski V, Kucherov G (1998) Reconstructing a hamiltonian cycle by querying the graph: application to DNA physical mapping. Discret Appl Math 88(1\u20133):147\u2013165","journal-title":"Discret Appl Math"},{"key":"9603_CR16","doi-asserted-by":"crossref","unstructured":"Gupta A, Krishnaswamy R, Ravi R (2009) Online and stochastic survivable network design. In: 41st Symposium on the theory of, computing, pp. 685\u2013694","DOI":"10.1145\/1536414.1536507"},{"key":"9603_CR17","doi-asserted-by":"crossref","unstructured":"Korach E, Stern M (2003) The clustering matroid and the optimal clustering tree. Math Program 98 (1\u20133):345\u2013414","DOI":"10.1007\/s10107-003-0410-x"},{"issue":"4","key":"9603_CR18","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.dam.2006.12.004","volume":"156","author":"E Korach","year":"2008","unstructured":"Korach E, Stern M (2008) The complete optimal stars-clustering-tree problem. Discret Appl Math 156(4):444\u2013450","journal-title":"Discret Appl Math"},{"key":"9603_CR19","doi-asserted-by":"crossref","unstructured":"Raz R, Safra S (1997) A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In: STOC, pp. 475\u2013484","DOI":"10.1145\/258533.258641"},{"key":"9603_CR20","doi-asserted-by":"crossref","unstructured":"Reyzin L, Srivastava N (2007) Learning and verifying graphs using queries with a focus on edge counting. In: 18th International conference on algorithmic learning theory, pp. 285\u2013297","DOI":"10.1007\/978-3-540-75225-7_24"},{"key":"9603_CR21","doi-asserted-by":"crossref","unstructured":"Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. In: KES (3), pp. 67\u201375","DOI":"10.1007\/978-3-540-85567-5_9"},{"issue":"4","key":"9603_CR22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey LA (1982) An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4):385\u2013393","journal-title":"Combinatorica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9603-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9603-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9603-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T08:13:59Z","timestamp":1595578439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9603-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,24]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9603"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9603-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,24]]}}}