{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T19:54:29Z","timestamp":1724529269632},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,18]],"date-time":"2011-03-18T00:00:00Z","timestamp":1300406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10951-011-0227-z","type":"journal-article","created":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T15:21:51Z","timestamp":1300375311000},"page":"81-91","source":"Crossref","is-referenced-by-count":9,"title":["Online capacity maximization in wireless networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Alexander","family":"Fangh\u00e4nel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sascha","family":"Geulen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,18]]},"reference":[{"key":"227_CR1","volume-title":"Proc. 28th IEEE conf. computer communications (INFOCOM)","author":"M. Andrews","year":"2009","unstructured":"Andrews, M., & Dinitz, M. (2009). Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In Proc. 28th IEEE conf. computer communications (INFOCOM)."},{"key":"227_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(83)90102-4","volume":"47","author":"P. Assouad","year":"1983","unstructured":"Assouad, P. (1983). Binary contraction of graphs. Discrete Mathematics, 47, 315\u2013319.","journal-title":"Discrete Mathematics"},{"key":"227_CR3","first-page":"373","volume-title":"Proc. 17th European symposium on algorithms (ESA)","author":"C. Avin","year":"2009","unstructured":"Avin, C., Lotker, Z., & Pignolet, Y. A. (2009). On the power of uniform power: capacity of wireless networks with bounded resources. In Proc. 17th European symposium on algorithms (ESA) (pp. 373\u2013384)."},{"issue":"6","key":"227_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1109\/JSAC.2004.830909","volume":"22","author":"H. Balakrishnan","year":"2004","unstructured":"Balakrishnan, H., Barrett, C. L., Kumar, V. A., Marathe, M. V., & Thite, S. (2004). The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal of Selected Areas in Communications, 22(6), 1069\u20131079.","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"227_CR5","first-page":"1166","volume-title":"Proc. 27th IEEE conf. computer communications (INFOCOM)","author":"D. Chafekar","year":"2008","unstructured":"Chafekar, D., Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2008). Approximation algorithms for computing capacity of wireless networks with SINR constraints. In Proc. 27th IEEE conf. computer communications (INFOCOM) (pp. 1166\u20131174)."},{"issue":"1","key":"227_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"K. L. Clarkson","year":"1999","unstructured":"Clarkson, K. L. (1999). Nearest neighbor queries in metric spaces. Discrete & Computational Geometry, 22(1), 63\u201393.","journal-title":"Discrete & Computational Geometry"},{"key":"227_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","volume-title":"Nearest-neighbor methods for learning and vision: theory and practice","author":"K.L. Clarkson","year":"2006","unstructured":"Clarkson, K.L. (2006). Nearest-neighbor search and metric space dimensions. In G. Shakhnarovich, T. Darell, & P. Indyk (Eds.), Nearest-neighbor methods for learning and vision: theory and practice (pp. 15\u201359). Cambridge: MIT Press."},{"key":"227_CR8","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/1582716.1582752","volume-title":"Proc. 28th symp. principles of distributed computing (PODC)","author":"A. Fangh\u00e4nel","year":"2009","unstructured":"Fangh\u00e4nel, A., Kesselheim, T., R\u00e4cke, H., & V\u00f6cking, B. (2009). Oblivious interference scheduling. In Proc. 28th symp. principles of distributed computing (PODC) (pp. 220\u2013229)."},{"key":"227_CR9","first-page":"208","volume-title":"Proc. 36th intl. colloq. automata, languages and programming (ICALP)","author":"A. Fangh\u00e4nel","year":"2009","unstructured":"Fangh\u00e4nel, A., Kesselheim, T., & V\u00f6cking, B. (2009). Improved algorithms for latency minimization in wireless networks. In Proc. 36th intl. colloq. automata, languages and programming (ICALP) (Vol.\u00a02, pp. 208\u2013219)."},{"key":"227_CR10","volume-title":"Proc. 28th IEEE conf. computer communications (INFOCOM)","author":"O. Goussevskaia","year":"2009","unstructured":"Goussevskaia, O., Halld\u00f3rsson, M. M., Wattenhofer, R., & Welzl, E. (2009). Capacity of arbitrary wireless networks. In Proc. 28th IEEE conf. computer communications (INFOCOM)."},{"key":"227_CR11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/1288107.1288122","volume-title":"Proc. 8th intl. symp. mobile ad-hoc networking and computing (MOBIHOC)","author":"O. Goussevskaia","year":"2007","unstructured":"Goussevskaia, O., Oswald, Y. A., & Wattenhofer, R. (2007). Complexity in geometric SINR. In Proc. 8th intl. symp. mobile ad-hoc networking and computing (MOBIHOC) (pp. 100\u2013109)."},{"key":"227_CR12","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46, 388\u2013404.","journal-title":"IEEE Transactions on Information Theory"},{"key":"227_CR13","unstructured":"Halldorsson, M. & Wattenhofer, R. 2010 Computing wireless capacity. Unpublished manuscript."},{"key":"227_CR14","first-page":"361","volume-title":"Proc. 17th European symposium on algorithms (ESA)","author":"M. M. Halldorsson","year":"2009","unstructured":"Halldorsson, M. M. (2009). Wireless scheduling with power control. In Proc. 17th European symposium on algorithms (ESA) (pp. 361\u2013372)."},{"key":"227_CR15","doi-asserted-by":"crossref","unstructured":"Kesselheim, T. (2011). A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In Proc. 22nd symp. discrete algorithms (SODA) (pp.\u00a01549\u20131559)","DOI":"10.1137\/1.9781611973082.120"},{"key":"227_CR16","first-page":"1","volume-title":"Proc. 25th IEEE conf. computer communications (INFOCOM)","author":"T. Moscibroda","year":"2006","unstructured":"Moscibroda, T., & Wattenhofer, R. (2006). The complexity of connectivity in wireless networks. In Proc. 25th IEEE conf. computer communications (INFOCOM) (pp. 1\u201313)."},{"key":"227_CR17","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1145\/1132905.1132939","volume-title":"Proc. 7th intl. symp. mobile ad-hoc networking and computing (MOBIHOC)","author":"T. Moscibroda","year":"2006","unstructured":"Moscibroda, T., Wattenhofer, R., Zollinger, A. (2006). Topology control meets SINR: the scheduling complexity of arbitrary topologies. In Proc. 7th intl. symp. mobile ad-hoc networking and computing (MOBIHOC) (pp. 310\u2013321)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0227-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0227-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0227-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T08:06:09Z","timestamp":1712304369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0227-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,18]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0227-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,18]]}}}