{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:01Z","timestamp":1725573301522},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_17","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"151-162","source":"Crossref","is-referenced-by-count":1,"title":["On Broadcast Scheduling with Limited Energy"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gunia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, S., Muthukrishnan, S.: Scheduling on-demand broadcasts: new metrics and algorithms. In: Proceedings of the 4th Annual ACM\/IEEE international conference on Mobile computing and networking (1998)","DOI":"10.1145\/288235.288248"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1145\/4221.4222","volume":"32","author":"I. Adler","year":"1985","unstructured":"Adler, I., Meggido, N.: A simplex algorithm whose average number of steps is bounded between two quadratic functions of smaller dimension. Journal of the ACM\u00a032, 871\u2013895 (1985)","journal-title":"Journal of the ACM"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A. Clementi","year":"2001","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00453-003-1018-5","volume":"36","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Pruhs, K.: Multicast pull scheduling: When fairness is fine. Algorithmica\u00a036(3), 315\u2013330 (2003)","journal-title":"Algorithmica"},{"key":"17_CR5","unstructured":"Erlebach, T., Hall, A.: NP-hardness of broadcast scheduling and inapproximability of single-source. In: Proceedings of the 13th Annual ACM-SIAM symposium on Discrete algorithms, pp. 194\u2013202 (2002)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. In: IEEE Symposium on Foundations of Computation, pp. 214\u2013221 (2000)","DOI":"10.1145\/347476.347479"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45253-2_27","volume-title":"Algorithms - ESA 2000","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"issue":"4","key":"17_CR8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.917539","volume":"34","author":"M. Mudge","year":"2001","unstructured":"Mudge, M.: Power: A first-class architectural design constraint. IEEE Computer Magazine\u00a034(4), 52\u201358 (2001)","journal-title":"IEEE Computer Magazine"},{"key":"17_CR9","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"A. Papoulis","year":"1984","unstructured":"Papoulis, A.: Probability, Random Variables, and Stochastic Processes, 2nd edn. McGraw-Hill, New York (1984)","edition":"2"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/3-540-45749-6_70","volume-title":"Algorithms - ESA 2002","author":"K. Pruhs","year":"2002","unstructured":"Pruhs, K., Uthaisombut, P.: A comparison of multicast pull models. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 808\u2013819. Springer, Heidelberg (2002)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. In: Scandanavian Workshop on Algorithms and Theory (2004)","DOI":"10.1007\/978-3-540-27810-8_3"},{"key":"17_CR12","unstructured":"Mailler, R., Lesser, V.: Using cooperative mediation to solve distributed constraint satisfaction problems. In: Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems. IEEE Computer Society, vol.\u00a01, pp. 446\u2013453 (2004)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF03325096","volume":"1","author":"W. Shen","year":"1999","unstructured":"Shen, W., Norrie, D.H.: Agent-based systems for intelligent manufacturing: A state-of-the-art survey. Knowledge and Information Systems\u00a01(2), 129\u2013156 (1999)","journal-title":"Knowledge and Information Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:19Z","timestamp":1619507059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11758471_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}