{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:47Z","timestamp":1725750587410},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_24","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"344-357","source":"Crossref","is-referenced-by-count":5,"title":["Sleeping Experts in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Dams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kesselheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: Proc. 28th IEEE Conf. Computer Communications (INFOCOM), pp. 1332\u20131340 (2009)","key":"24_CR1","DOI":"10.1109\/INFCOM.2009.5062048"},{"doi-asserted-by":"crossref","unstructured":"Asgeirsson, E.I., Mitra, P.: On a game theoretic approach to capacity maximization in wireless networks. In: Proc. 30th IEEE Conf. Computer Communications (INFOCOM), pp. 3029\u20133037 (2011)","key":"24_CR2","DOI":"10.1109\/INFCOM.2011.5935146"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1007335615132","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A.: Empirical support for winnow and weighted-majority algorithms: Results on a calendar scheduling domain. Machine Learning\u00a026(1), 5\u201323 (1997)","journal-title":"Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"Dams, J., Hoefer, M., Kesselheim, T.: Jamming-resistant learning in wireless networks. CoRR, abs\/1307.5290 (2013)","key":"24_CR4","DOI":"10.1007\/978-3-642-41527-2_24"},{"doi-asserted-by":"crossref","unstructured":"Dams, J., Hoefer, M., Kesselheim, T.: Scheduling in wireless networks with Rayleigh-fading interference. In: Proc. 24th Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 327\u2013335 (2012)","key":"24_CR5","DOI":"10.1145\/2312005.2312061"},{"doi-asserted-by":"crossref","unstructured":"Dinitz, M.: Distributed algorithms for approximating wireless network capacity. In: Proc. 29th IEEE Conf. Computer Communications (INFOCOM), pp. 1397\u20131405 (2010)","key":"24_CR6","DOI":"10.1109\/INFCOM.2010.5461905"},{"issue":"6","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. SIAM J. Comput.\u00a034(6), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R., Singer, Y., Warmuth, M.: Using and combining predictors that specialize. In: Proc. 29th Symp. Theory of Computing (STOC), pp. 334\u2013343 (1997)","key":"24_CR8","DOI":"10.1145\/258533.258616"},{"doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halld\u00f3rsson, M., Wattenhofer, R., Welzl, E.: Capacity of arbitrary wireless networks. In: Proc. 28th IEEE Conf. Computer Communications (INFOCOM), pp. 1872\u20131880 (2009)","key":"24_CR9","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02927-1_44","volume-title":"Automata, Languages and Programming","author":"M. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 525\u2013536. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Hoefer, M., Kesselheim, T., V\u00f6cking, B.: Approximation algorithms for secondary spectrum auctions. In: Proc. 23rd Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 177\u2013186 (2011)","key":"24_CR11","DOI":"10.1145\/1989493.1989520"},{"key":"24_CR12","first-page":"272","volume":"5","author":"V. Kanade","year":"2009","unstructured":"Kanade, V., McMahan, B., Bryan, B.: Sleeping experts and bandits with stochastic action availability and adversarial rewards. J. Machine Learning Res. - Proc. Track\u00a05, 272\u2013279 (2009)","journal-title":"J. Machine Learning Res. - Proc. Track"},{"doi-asserted-by":"crossref","unstructured":"Kanade, V., Steinke, T.: Learning hurdles for sleeping experts. In: Proc. 3rd Symp. Innovations in Theoret. Computer Science (ITCS), pp. 11\u201318 (2012)","key":"24_CR13","DOI":"10.1145\/2090236.2090238"},{"issue":"2-3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-010-5178-7","volume":"80","author":"R. Kleinberg","year":"2010","unstructured":"Kleinberg, R., Niculescu-Mizil, A., Sharma, Y.: Regret bounds for sleeping experts and bandits. Machine Learning\u00a080(2-3), 245\u2013272 (2010)","journal-title":"Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proc. 25th IEEE Conf. Computer Communications (INFOCOM), pp. 1\u201313 (2006)","key":"24_CR15","DOI":"10.1109\/INFOCOM.2006.23"},{"doi-asserted-by":"crossref","unstructured":"Nieberg, T., Hurink, J., Kern, W.: Approximation schemes for wireless networks. ACM Trans. Algorithms\u00a04(4) (2008)","key":"24_CR16","DOI":"10.1145\/1383369.1383380"},{"doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: Coloring unstructured wireless multi-hop networks. In: Proc. 28th Symp. Principles of Distrib. Comput. (PODC), pp. 210\u2013219 (2009)","key":"24_CR17","DOI":"10.1145\/1582716.1582751"},{"issue":"5-6","key":"24_CR18","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-010-0097-1","volume":"22","author":"J. Schneider","year":"2010","unstructured":"Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distributed Computing\u00a022(5-6), 349\u2013361 (2010)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:50:00Z","timestamp":1558119000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}