{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:20:08Z","timestamp":1743031208604,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453458"},{"type":"electronic","value":"9783642453465"}],"license":[{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45346-5_12","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T12:33:16Z","timestamp":1386851596000},"page":"155-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Station Assignment with Applications to Sensing"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,13]]},"reference":[{"key":"12_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: SODA, pp. 493\u2013500 (1997)"},{"key":"12_CR2","first-page":"174","volume-title":"OPODIS 2009. LNCS","author":"L Anantharamu","year":"2009","unstructured":"Anantharamu, L., Chlebus, B.S., Rokicki, M.A.: Adversarial multiple access channel with individual injection rates. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 174\u2013188. Springer, Heidelberg (2009)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Leighton, F.T., Liu, Z., Kleinberg, J.M.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48(1), 39\u201369 (2001)","journal-title":"J. ACM"},{"issue":"5","key":"12_CR4","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1145\/1089023.1089028","volume":"52","author":"M Andrews","year":"2005","unstructured":"Andrews, M., Zhang, L.: Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. J. ACM 52(5), 809\u2013834 (2005)","journal-title":"J. ACM"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. In: STOC, pp. 623\u2013631 (1993)","DOI":"10.1145\/167088.167248"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y.: On-line load balancing. In: Online Algorithms, pp. 178\u2013195 (1996)","DOI":"10.1007\/BFb0029569"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)90153-8","volume":"130","author":"Y Azar","year":"1994","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R.: On-line load balancing. Theor. Comput. Sci. 130(1), 73\u201384 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jagm.1995.0799","volume":"22","author":"Y Azar","year":"1997","unstructured":"Azar, Y., Kalyanasundaram, B., Plotkin, S.A., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. J. Algorithms 22(1), 93\u2013110 (1997)","journal-title":"J. Algorithms"},{"key":"12_CR9","first-page":"121","volume-title":"DISC 2012. LNCS","author":"M Bienkowski","year":"2012","unstructured":"Bienkowski, M., Jurdzinski, T., Korzeniowski, M., Kowalski, D.R.: Distributed online and stochastic queuing on a multiple access channel. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 121\u2013135. Springer, Heidelberg (2012)"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/s00224-007-9046-1","volume":"44","author":"MJ Blesa","year":"2009","unstructured":"Blesa, M.J., Calzada, D., Fern\u00e1ndez, A., L\u00f3pez, L., Mart\u00ednez, A.L., Santos, A., Serna, M.J., Thraves, C.: Adversarial queueing model for continuous network dynamics. Theor. Comput. Syst. 44(3), 304\u2013331 (2009)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J.M., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13\u201338 (2001)","journal-title":"J. ACM"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101 (2006)","DOI":"10.1145\/1146381.1146398"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. Bell Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms 20, 400\u2013430 (1996)","journal-title":"J. Algorithms"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: Dynamic packet scheduling in wireless networks. In: PODC, pp. 281\u2013290 (2012)","DOI":"10.1145\/2332432.2332487"},{"key":"12_CR16","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis (Chapter\u00a015), pp. 15-1\u201315-41. CRC Press, Boca Raton (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45346-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T17:08:20Z","timestamp":1674148100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45346-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,13]]},"ISBN":["9783642453458","9783642453465"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45346-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013,12,13]]},"assertion":[{"value":"13 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}