{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:10:20Z","timestamp":1726409420153},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319428352"},{"type":"electronic","value":"9783319428369"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42836-9_3","type":"book-chapter","created":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T02:30:38Z","timestamp":1470191438000},"page":"24-36","source":"Crossref","is-referenced-by-count":5,"title":["A New Paradigm for Shortest Link Scheduling in Wireless Networks: Theory and Applications"],"prefix":"10.1007","author":[{"given":"Fahad","family":"Al-dhelaan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaqiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and application. Theor. Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theor. Comput."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: Proceedings of IEEE FOCS, pp. 322\u2013331 (1995)","DOI":"10.1109\/SFCS.1995.492488"},{"issue":"3","key":"3_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., Warmuth, M.: How to use expert advice. J. Assoc. Comput. Mach. 44(3), 427\u2013485 (1997)","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: IEEE INFOCOM, pp. 1166\u20131174 (2008)","DOI":"10.1109\/INFOCOM.2008.172"},{"issue":"1","key":"3_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.: A decision-theoretic generalization of online learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games Econ. Behav. 29, 79\u2013103 (1999)","journal-title":"Games Econ. Behav."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Han, B., Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Distributed strategies for channel allocation and scheduling in software-defined radio networks. In: Proceedings of the IEEE INFOCOM, pp. 1521\u20131529 (2009)","DOI":"10.1109\/INFCOM.2009.5062069"},{"issue":"3","key":"3_CR8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/S0895480101396949","volume":"20","author":"K Jansen","year":"2006","unstructured":"Jansen, K., Porkolab, L.: On preemptive resource constrained scheduling: polynomial-time approximation schemes. SIAM J. Discrete Math. 20(3), 545\u2013563 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR9","unstructured":"Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems, Ph.D. thesis, Indian Institute of Technology, Delhi (2004)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kodialam, M., Nandagopal, T.: Characterizing achievable ratesin multi-hop wireless networks: the joint routing and scheduling problem. In: Proceedings of the ACM MobiCom (2003)","DOI":"10.1145\/938990.938991"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kodialam, M., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: Proceedings of the ACM MobiCom (2005)","DOI":"10.1145\/1080829.1080837"},{"issue":"1","key":"3_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/1071690.1064228","volume":"33","author":"VSA Kumar","year":"2005","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Algorithmic aspects of capacity in wireless networks. SIGMETRICS Perform. Eval. Rev. 33(1), 133\u2013144 (2005)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/JSAC.2008.080808","volume":"6","author":"J Liu","year":"2008","unstructured":"Liu, J., Hou, Y.T., Shi, Y., Sherali, H.: Cross-layer optimization for MIMO-based wireless ad hoc networks: routing. IEEE J. Sel. Areas Commun. Power Allocation Bandwidth allocation 6, 913\u2013926 (2008)","journal-title":"IEEE J. Sel. Areas Commun. Power Allocation Bandwidth allocation"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-39701-1_6","volume-title":"Wireless Algorithms, Systems, and Applications","author":"C Ma","year":"2013","unstructured":"Ma, C., Al-dhelaan, F., Wan, P.-J.: Maximum independent set of links with a monotone and sublinear power assignment. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds.) WASA 2013. LNCS, vol. 7992, pp. 64\u201375. Springer, Heidelberg (2013)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-642-39701-1_39","volume-title":"Wireless Algorithms, Systems, and Applications","author":"C Ma","year":"2013","unstructured":"Ma, C., Al-dhelaan, F., Wan, P.-J.: Maximum independent set of links with power control. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds.) WASA 2013. LNCS, vol. 7992, pp. 474\u2013485. Springer, Heidelberg (2013)"},{"key":"3_CR16","series-title":"Algorithms and Combinatorics.","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Algorithms and Combinatorics., vol. 24. Springer, Heidelberg (2003)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"V. Vovk. A game of prediction with expert advice. In: Proceedings of the 8th Annual Conference on Computational Learning Theory, pp. 51\u201360 (1995)","DOI":"10.1145\/225298.225304"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Wan, P.-J.: Multiflows in Multihop Wireless Networks, In: ACM MOBIHOC, pp. 85\u201394 (2009)","DOI":"10.1145\/1530748.1530761"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Chen, D., Dai, G., Wang, Z., Yao, F.: Maximizing capacity with power control under physical interference model in duplex mode. In: IEEE INFOCOM, pp. 415\u2013423 (2012)","DOI":"10.1109\/INFCOM.2012.6195780"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Cheng, Y., Wang, Z., Yao, F.: Multiflows in multi-channel multi-radio multihop wireless networks. In: IEEE INFOCOM, pp. 846\u2013854 (2011)","DOI":"10.1109\/INFCOM.2011.5935308"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Frieder, O., Jia, X., Yao, F., Xu, X.-H., Tang, S.-J.: Wireless link scheduling under physical interference model. In: IEEE INFOCOM, pp. 838\u2013845 (2011)","DOI":"10.1109\/INFCOM.2011.5935307"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Jia, X., Dai, G., Du, H., Wan, Z.G., Frieder, O.: Scalable algorithms for wireless link schedulings in multi-channel multi-radio wireless networks. In: IEEE INFOCOM, pp. 2121\u20132129 (2013)","DOI":"10.1109\/INFCOM.2013.6567014"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Jia, X., Dai, G., Du, H., Frieder, O.: Fast and simple approximation algorithms for maximum weighted independent set of links. In: IEEE INFOCOM, pp. 1653\u20131661 (2014)","DOI":"10.1109\/INFOCOM.2014.6848102"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Wang, L., Ma, C., Wang, Z., Xu, B., Li, M.: Maximizing wireless network capacity with linear power: breaking the logarithmic barrier. In: IEEE INFOCOM, pp. 135\u2013139 (2013)","DOI":"10.1109\/INFCOM.2013.6566750"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Xu, B., Frieder, O., Ji, S., Wang, B., Xu, X.: Capacity maximization in wireless MIMO networks with receiver-side interference suppression. In: ACM MOBIHOC, pp. 145\u2013154 (2014)","DOI":"10.1145\/2632951.2632989"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42836-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T02:57:24Z","timestamp":1568257044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42836-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319428352","9783319428369"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42836-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}