{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:26:11Z","timestamp":1778610371905,"version":"3.51.4"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF","award":["CNS-0964391"],"award-info":[{"award-number":["CNS-0964391"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/tnet.2015.2442597","type":"journal-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T21:24:47Z","timestamp":1436304287000},"page":"1690-1703","source":"Crossref","is-referenced-by-count":7,"title":["Online Load Balancing Under Graph Constraints"],"prefix":"10.1109","volume":"24","author":[{"given":"Sharayu","family":"Moharir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujay","family":"Sanghavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Shakkottai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1060"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1435375.1435377"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9293-y"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110508"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00140-1"},{"key":"ref15","first-page":"352","article-title":"An optimal algorithm for on-line bipartite matching","author":"karp","year":"1990","journal-title":"Proc 22nd Annu ACM Symp Theory Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/3212147"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777416"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.12"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483293"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120157"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1360443.1360462"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11775096_5"},{"key":"ref29","year":"0","journal-title":"?YouTube ?"},{"key":"ref5","first-page":"145","volume":"3142","author":"chrobak","year":"2004","journal-title":"Automata Languages and Programming"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93980-1_4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1055"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-003-0024-4"},{"key":"ref9","first-page":"982","article-title":"Online budgeted matching in random input models with applications to adwords","author":"goel","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM SODA"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.95"},{"key":"ref20","article-title":"Load balancing with deadlines and graph constraints","author":"moharir","year":"2013","journal-title":"The 51st Annual Allerton Conference"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1109\/TVT.2006.873832","article-title":"A cross-layer scheduling algorithm with qos support in wireless networks","volume":"55","author":"qingwen","year":"2006","journal-title":"IEEE Trans Veh Technol"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465751"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.217"},{"key":"ref23","year":"0","journal-title":"?Netflix ?"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012763307361"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/90\/7491396\/07150433.pdf?arnumber=7150433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:45:31Z","timestamp":1642005931000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/7150433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":29,"journal-issue":{"issue":"3"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tnet.2015.2442597","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}