{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:56Z","timestamp":1763468096376},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_57","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"659-670","source":"Crossref","is-referenced-by-count":17,"title":["Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Kesselheim","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","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 INFOCOM, pp. 1332\u20131340 (2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"issue":"7","key":"57_CR2","doi-asserted-by":"publisher","first-page":"2640","DOI":"10.1109\/TWC.2007.05960","volume":"6","author":"M. Chiang","year":"2007","unstructured":"Chiang, M., Tan, C.W., Palomar, D., O\u2019Neill, D., Julian, D.: Power control by geometric programming. IEEE Transactions on Wireless Communication\u00a06(7), 2640\u20132651 (2007)","journal-title":"IEEE Transactions on Wireless Communication"},{"key":"57_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-22012-8_51","volume-title":"Automata, Languages and Programming","author":"J. Dams","year":"2011","unstructured":"Dams, J., Hoefer, M., Kesselheim, T.: Convergence Time of Power-Control Dynamics. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 637\u2013649. Springer, Heidelberg (2011)"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Dams, J., Hoefer, M., Kesselheim, T.: Scheduling in wireless networks with Rayleigh-fading interference. In: Proc. 24th SPAA, pp. 327\u2013335 (2012)","DOI":"10.1145\/2312005.2312061"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Fangh\u00e4nel, A., Geulen, S., Hoefer, M., V\u00f6cking, B.: Online capacity maximization in wireless networks. In: Proc. 22nd SPAA, pp. 92\u201399 (2010)","DOI":"10.1145\/1810479.1810499"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Fangh\u00e4nel, A., Kesselheim, T., R\u00e4cke, H., V\u00f6cking, B.: Oblivious interference scheduling. In: Proc. 28th PODC, pp. 220\u2013229 (2009)","DOI":"10.1145\/1582716.1582752"},{"issue":"24","key":"57_CR7","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1016\/j.tcs.2010.05.004","volume":"412","author":"A. Fangh\u00e4nel","year":"2011","unstructured":"Fangh\u00e4nel, A., Kesselheim, T., V\u00f6cking, B.: Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science\u00a0412(24), 2657\u20132667 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"57_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/25.260747","volume":"42","author":"G.J. Foschini","year":"1992","unstructured":"Foschini, G.J., Miljanic, Z.: A simple distributed autonomous power control algorithm and its convergence. IEEE Transactions on Vehicular Technology\u00a042(4), 641\u2013646 (1992)","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Wattenhofer, R., Halld\u00f3rsson, M.M., Welzl, E.: Capacity of arbitrary wireless networks. In: Proc. 28th INFOCOM, pp. 1872\u20131880 (2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"57_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00020","volume":"4","author":"M.M. Halld\u00f3rsson","year":"2000","unstructured":"Halld\u00f3rsson, M.M.: Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications\u00a04, 1\u201316 (2000)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"57_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-04128-0_33","volume-title":"Algorithms - ESA 2009","author":"M.M. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.M.: Wireless Scheduling with Power Control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 361\u2013372. Springer, Heidelberg (2009)"},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-642-22012-8_50","volume-title":"Automata, Languages and Programming","author":"M.M. Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 625\u2013636. Springer, Heidelberg (2011)"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: Proc. 22nd SODA, pp. 1538\u20131548 (2011)","DOI":"10.1137\/1.9781611973082.119"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless capacity and admission control in cognitive radio. In: Proc. 31st INFOCOM, pp. 855\u2013863 (2012)","DOI":"10.1109\/INFCOM.2012.6195834"},{"issue":"5","key":"57_CR15","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/JSAC.2006.872889","volume":"24","author":"J. Huang","year":"2006","unstructured":"Huang, J., Berry, R., Honig, M.: Distributed interference compensation for wireless networks. IEEE Journal on Sel. Areas in Comm.\u00a024(5), 1074\u20131084 (2006)","journal-title":"IEEE Journal on Sel. Areas in Comm."},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Proc. 22nd SODA, pp. 1549\u20131559 (2011)","DOI":"10.1137\/1.9781611973082.120"},{"key":"57_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-15763-9_16","volume-title":"Distributed Computing","author":"T. Kesselheim","year":"2010","unstructured":"Kesselheim, T., V\u00f6cking, B.: Distributed Contention Resolution in Wireless Networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 163\u2013178. Springer, Heidelberg (2010)"},{"key":"57_CR18","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Parter, M., Peleg, D., Pignolet, Y.A.: Distributed power control in the SINR model. In: Proc. 30th INFOCOM, pp. 2525\u20132533 (2011)","DOI":"10.1109\/INFCOM.2011.5935077"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Santi, P., Maheshwari, R., Resta, G., Das, S., Blough, D.M.: Wireless link scheduling under a graded SINR interference model. In: Proc. 2nd FOWANC, pp. 3\u201312 (2009)","DOI":"10.1145\/1540343.1540346"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Singh, V., Kumar, K.: Literature survey on power control algorithms for mobile ad-hoc network. Wireless Personal Communications, 1\u20137 (2010)","DOI":"10.1007\/s11277-010-9967-x"},{"key":"57_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-23490-3_8","volume-title":"Wireless Algorithms, Systems, and Applications","author":"P.-J. Wan","year":"2011","unstructured":"Wan, P.-J., Ma, C., Tang, S., Xu, B.: Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol.\u00a06843, pp. 84\u201395. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T19:07:37Z","timestamp":1643310457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}