{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T19:07:03Z","timestamp":1791313623889,"version":"4.3.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infocom.2015.7218497","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T17:33:36Z","timestamp":1440437616000},"page":"1221-1229","source":"Crossref","is-referenced-by-count":5,"title":["The online disjoint set cover problem and its applications"],"prefix":"10.1109","author":[{"given":"Ashwin","family":"Pananjady","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vivek Kumar","family":"Bagaria","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rahul","family":"Vaze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Optimization techniques for task allocation and scheduling in distributed multi-agent operations","author":"tompkins","year":"2003"},{"key":"ref11","author":"borodin","year":"1998","journal-title":"Online Computation and Competitive Analysis"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/110856332"},{"key":"ref13","author":"alon","year":"2004","journal-title":"The Probabilistic Method"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref15","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20274"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.276"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290684"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2004.1311452"},{"key":"ref3","article-title":"Optimally approximating the lifetime of wireless sensor networks","author":"bagaria","year":"2013","journal-title":"arXiv preprint arXiv 1307 5230"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2014.6811252"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936985"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195568"},{"key":"ref7","article-title":"Offline and online incentive mechanism design for smart-phone crowd-sourcing","author":"subramanian","year":"2013","journal-title":"arXiv Preprint arXiv 1310 1746"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700380754"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-6615-6"},{"key":"ref9","article-title":"Fundamentals of supply chain management","author":"lu","year":"2011","journal-title":"Bookboon"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications","location":"Kowloon, Hong Kong","start":{"date-parts":[[2015,4,26]]},"end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications (INFOCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172813\/7218353\/07218497.pdf?arnumber=7218497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T02:28:01Z","timestamp":1490408881000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7218497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/infocom.2015.7218497","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}