{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:51Z","timestamp":1725537471351},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_35","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:16:36Z","timestamp":1252952196000},"page":"385-396","source":"Crossref","is-referenced-by-count":0,"title":["Approximability of OFDMA Scheduling"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Ochel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1132516.1132522","volume-title":"STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., Sviridenko, M.: The santa claus problem. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 31\u201340. ACM, New York (2006)"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TWC.2008.060559","volume":"7","author":"A. Feiten","year":"2008","unstructured":"Feiten, A., Mathar, R., Reyer, M.: Rate and power allocation for multiuser ofdm: An effective heuristic verified by branch-and-bound. IEEE Transactions on Wireless Communications\u00a07(1), 60\u201364 (2008)","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. ACM\u00a034(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/JSAC.2002.807348","volume":"21","author":"J. Jang","year":"2003","unstructured":"Jang, J., Lee, K.B.: Transmit power adaptation for multiuser ofdm systems. IEEE Journal on Selected Areas in Communications\u00a021(2), 171\u2013178 (2003)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TVT.2006.877490","volume":"55","author":"I. Kim","year":"2006","unstructured":"Kim, I., Park, I.-S., Lee, Y.H.: Use of linear programming for dynamic subcarrier and bit allocation in multiuser ofdm. IEEE Transactions on Vehicular Technology\u00a055(4), 1195\u20131207 (2006)","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"6","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1109\/TWC.2003.819016","volume":"2","author":"D. Kivanc","year":"2003","unstructured":"Kivanc, D., Li, G., Liu, H.: Computationally efficient bandwidth allocation and power control for ofdma. IEEE Transactions on Wireless Communications\u00a02(6), 1150\u20131158 (2003)","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Seong, K., Yu, D.D., Kim, Y., Cioffi, J.M.: Optimal resource allocation via geometric programming for ofdm broadcast and multiple access channels. In: GLOBECOM (2006)","DOI":"10.1109\/GLOCOM.2006.50"},{"key":"35_CR9","unstructured":"Vemulapalli, M., Dasgupta, S.: Np-hardness of bit allocation in multiuser multicarrier communications. In: Proceedings of EUSIPCO 2006 (2006)"},{"issue":"4","key":"35_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"G.J. Woeginger","year":"1997","unstructured":"Woeginger, G.J.: A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters\u00a020(4), 149\u2013154 (1997)","journal-title":"Operations Research Letters"},{"issue":"10","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1109\/49.793310","volume":"17","author":"C.Y. Wong","year":"1999","unstructured":"Wong, C.Y., Cheng, R.S., Lataief, K.B., Murch, R.D.: Multiuser ofdm with adaptive subcarrier, bit, and power allocation. IEEE Journal on Selected Areas in Communications\u00a017(10), 1747\u20131758 (1999)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:50:40Z","timestamp":1552161040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}