{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:42:22Z","timestamp":1729676542245,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8486295","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T18:45:36Z","timestamp":1539888336000},"page":"1349-1357","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Crawling with Multiple Bots: A Matroid Intersection Approach"],"prefix":"10.1109","author":[{"given":"Xiang","family":"LI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. David","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thang N.","family":"Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"73","article-title":"An analysis of approximations for maximizing submodular set functions - II","author":"fisher","year":"0","journal-title":"Polyhedral Combinatorics"},{"key":"ref11","first-page":"341","article-title":"The efficacy of the greedy algorithm","author":"jenkyns","year":"1976","journal-title":"Proc of 7th South Eastern Conference on Combinatorics Graph Theory and Computing"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0120891","article-title":"Worst case analysis of greedy type algorithms for independence systems","author":"hausmann","year":"1980","journal-title":"Combinatorial Optimization"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_19"},{"key":"ref14","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"golovin","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref15","article-title":"Adaptive submodular optimization under matroid constraints","volume":"abs11101 4450","year":"2011","journal-title":"CoRR Arxiv"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5311-6_14"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"ref18","volume":"24","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-642-35264-5_21","article-title":"A Practical Study on Advanced Persistent Threats","author":"jeun","year":"2012","journal-title":"Computer Applications for Security Control and System Engineering Communications in Computer and Information Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3091478.3091492"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1145\/2808797.2809396","article-title":"Hunting Organization-Targeted Socialbots","author":"paradise","year":"2015","journal-title":"Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 ser ASONAM '15"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2076732.2076746"},{"key":"ref8","article-title":"Max-outprobe: An algorithm for increasing the size of partially observed networks.","author":"pinar","year":"2015","journal-title":"Tech Rep"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242809"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.130"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2016.0051"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref20"},{"key":"ref21","volume":"18","author":"mann","year":"0","journal-title":"On A Test of Whether One of Two Random Variables Is Stochastically Larger Than the Other"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","start":{"date-parts":[[2018,4,16]]},"location":"Honolulu, HI","end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08486295.pdf?arnumber=8486295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T06:29:16Z","timestamp":1662272956000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8486295\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8486295","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}