{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:37:17Z","timestamp":1742996237725,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_33","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"361-372","source":"Crossref","is-referenced-by-count":38,"title":["Wireless Scheduling with Power Control"],"prefix":"10.1007","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_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: INFOCOM (April 2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., Lotker, Z., Pignolet, Y.A.: On the power of uniform power: Capacity of wireless networks with bounded resources. In: These proceedings (2009)","DOI":"10.1007\/978-3-642-04128-0_34"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Cross-layer Latency Minimization for Wireless Networks using SINR Constraints. In: Mobihoc (2007)","DOI":"10.1145\/1288107.1288123"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"K.L. Clarkson","year":"1999","unstructured":"Clarkson, K.L.: Nearest neighbor queries in metric spaces. Discrete and Computational Geometry\u00a022, 63\u201393 (1999)","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TWC.2003.819032","volume":"3","author":"T.A. ElBatt","year":"2004","unstructured":"ElBatt, T.A., Ephremides, A.: Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communications\u00a03(1), 74\u201385 (2004)","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Fangh\u00e4nel, A., Ke\u00dfelheim, T., R\u00e4cke, H., V\u00f6cking, B.: Oblivious interference scheduling. In: PODC (August 2009)","DOI":"10.1145\/1582716.1582752"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/978-3-642-02930-1_37","volume-title":"ICALP 2009. Part II","author":"A. Fangh\u00e4nel","year":"2009","unstructured":"Fangh\u00e4nel, A., Ke\u00dfelheim, T., V\u00f6cking, B.: Improved algorithms for latency minimization in wireless networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part II. LNCS, vol.\u00a05556, pp. 447\u2013458. Springer, Heidelberg (2009)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halld\u00f3rsson, M.M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: INFOCOM (April 2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: Mobihoc, pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Gronkvist, J., Hansson, A.: Comparison between graph-based and interference-based STDMA scheduling. In: Mobihoc, pp. 255\u2013258 (2001)","DOI":"10.1145\/501449.501453"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Trans. Information Theory\u00a046(2), 388\u2013404 (2000)","journal-title":"IEEE Trans. Information Theory"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","first-page":"447","volume-title":"ICALP 2009. Part II","author":"M.M. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.M., Wattenhofer, R.: Wireless Communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part II. LNCS, vol.\u00a05556, pp. 447\u2013458. Springer, Heidelberg (2009)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Maheshwari, R., Jain, S., Das, S.R.: A measurement study of interference modeling and scheduling in low-power wireless networks. In: SenSys, pp. 141\u2013154 (2008)","DOI":"10.1145\/1460412.1460427"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In: INFOCOM, pp. 1433\u20131441 (2007)","DOI":"10.1109\/INFCOM.2007.169"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"33_CR16","unstructured":"Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. In: Hotnets (November 2006)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control meets SINR: The Scheduling Complexity of Arbitrary Topologies. In: Mobihoc (2006)","DOI":"10.1145\/1132905.1132939"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:35:16Z","timestamp":1558269316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}