{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:42:58Z","timestamp":1725766978112},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/infocom.2014.6848205","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T11:18:13Z","timestamp":1406632693000},"page":"2580-2588","source":"Crossref","is-referenced-by-count":10,"title":["Maximizing the number of satisfied subscribers in pub\/sub systems under capacity constraints"],"prefix":"10.1109","author":[{"given":"Vinay","family":"Setty","sequence":"first","affiliation":[]},{"given":"Gunnar","family":"Kreitz","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Urdaneta","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Vitenberg","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"van Steen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/857076.857078"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"journal-title":"A Note on the Budgeted Maximization of Submodular Functions","year":"2011","author":"krause","key":"18"},{"journal-title":"Approximation Algorithms for NP-Hard Problems","year":"1997","author":"hochbaum","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"journal-title":"Maximizing the Number of Satisfied Subscribers in Pub\/sub Systems under Capacity Constraints","year":"2013","author":"setty","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"year":"0","key":"3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.86"},{"key":"2","article-title":"GooPS: Pub\/Sub at Google","author":"reumann","year":"2009","journal-title":"Oslo Norway Lecture & Personal Communications at EuroSys & CANOE Summer School"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/2488222.2488273"},{"key":"10","first-page":"20","article-title":"Scaling microblogging services with divergent traffic demands","author":"xu","year":"2011","journal-title":"Proc ACM\/IFIP\/USENIX Middleware"},{"key":"7","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1007\/978-0-387-39940-9_1221","article-title":"Peer-to-peer publishsubscribe systems","author":"triantafillou","year":"2009","journal-title":"Encyclopedia of Database Systems"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1658373.1658375"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060824"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1330107.1330111"},{"journal-title":"On the densest k-subgraph problems","year":"1997","author":"feige","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2010.5569963"}],"event":{"name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","start":{"date-parts":[[2014,4,27]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,5,2]]}},"container-title":["IEEE INFOCOM 2014 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6839150\/6847911\/06848205.pdf?arnumber=6848205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T14:11:52Z","timestamp":1598105512000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6848205\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/infocom.2014.6848205","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}