{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:57:59Z","timestamp":1648835879742},"reference-count":13,"publisher":"Elsevier BV","issue":"39","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T00:00:00Z","timestamp":1456358400000},"content-version":"vor","delay-in-days":1638,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1016\/j.tcs.2011.05.033","type":"journal-article","created":{"date-parts":[[2011,6,5]],"date-time":"2011-06-05T18:29:15Z","timestamp":1307298555000},"page":"5247-5275","source":"Crossref","is-referenced-by-count":1,"title":["Online rectangle filling"],"prefix":"10.1016","volume":"412","author":[{"given":"Haitao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Amitabh","family":"Chaudhary","sequence":"additional","affiliation":[]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2011.05.033_br000005","unstructured":"S. Albers, Competitive online algorithms, in: BRICS Lecture Series LS-96-2, BRICS, Department of Computer Science, University of Aarhus, September 1996."},{"key":"10.1016\/j.tcs.2011.05.033_br000010","doi-asserted-by":"crossref","unstructured":"M. Andrews, L. Zhang, Scheduling over a time-varying user-dependent channel with applications to high speed wireless data, in: Proceedings of 43rd Symposium on Foundations of Computer Science, 2002, pp. 293\u2013302.","DOI":"10.1109\/SFCS.2002.1181952"},{"key":"10.1016\/j.tcs.2011.05.033_br000015","unstructured":"A. Arora, H. Choi, Channel aware scheduling in wireless networks, Technical Report 002, The George Washington University, 2006."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2011.05.033_br000020","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.tcs.2006.09.016","article-title":"Scheduling resource allocation with timeslot penalty for changeover","volume":"369","author":"Arora","year":"2006","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/j.tcs.2011.05.033_br000025","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00236-006-0012-1","article-title":"Throughput analysis in wireless networks with multiple users and multiple channels","volume":"43","author":"Arora","year":"2006","journal-title":"Acta Informatica"},{"key":"10.1016\/j.tcs.2011.05.033_br000030","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/j.tcs.2011.05.033_br000035","doi-asserted-by":"crossref","unstructured":"S. Borst, User-level performance of channel-aware scheduling algorithms in wireless data networks, in: Proceedings of IEEE INFOCOM\u201903, 2003, pp. 321\u2013331.","DOI":"10.1109\/INFCOM.2003.1208684"},{"key":"10.1016\/j.tcs.2011.05.033_br000040","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/MCOM.2002.1007416","article-title":"Adaptive modulation and MIMO coding for broadband wireless data networks","volume":"40","author":"Catreux","year":"2002","journal-title":"IEEE Communications Magazine"},{"key":"10.1016\/j.tcs.2011.05.033_br000045","unstructured":"F. Jin, G. Sahin, A. Arora, H. Choi, The effects of the sub-carrier grouping on multi-carrier channel aware scheduling, in: Proceedings of the First International Conference on Broadband Networks, BROADNETS\u201904, 2004, pp. 632\u2013640."},{"key":"10.1016\/j.tcs.2011.05.033_br000050","doi-asserted-by":"crossref","unstructured":"G. Sahin, F. Jin, A. Arora, H. Choi, Predictive scheduling in multi-carrier wireless networks with link adaptation, in: Proceedings of 60th Vehicular Technology Conference, VTC2004-Fall, vol. 7, 2004, pp. 5015\u20135020.","DOI":"10.1109\/VETECF.2004.1405053"},{"key":"10.1016\/j.tcs.2011.05.033_br000055","series-title":"Wireless Communication & Networks","author":"Stallings","year":"2001"},{"key":"10.1016\/j.tcs.2011.05.033_br000060","doi-asserted-by":"crossref","unstructured":"V. Tsibonis, L. Georgiadis, L. Tassiulas, Exploiting wireless channel state information for throughput maximization, in: Proceedings of IEEE INFOCOM\u201903, 2003, pp. 301\u2013310.","DOI":"10.1109\/INFCOM.2003.1208682"},{"issue":"1","key":"10.1016\/j.tcs.2011.05.033_br000065","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10878-009-9246-5","article-title":"New algorithms for online rectangle filling with k-lookahead","volume":"21","author":"Wang","year":"2011","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397511004427?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397511004427?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T09:58:39Z","timestamp":1543744719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511004427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":13,"journal-issue":{"issue":"39","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["S0304397511004427"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2011.05.033","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}