{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T21:10:26Z","timestamp":1767474626267,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148484"},{"type":"electronic","value":"9783642148491"}],"license":[{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-14849-1_2","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T15:47:28Z","timestamp":1303919248000},"page":"31-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling and Power Assignments in the Physical Model"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Fangh\u00e4nel","sequence":"first","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,8]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Andrews and M. Dinitz. Maximizing capacity in arbitrary wireless networks in the SINR model: Comple xity and game theory. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), Rio de Janeiro, Brazil, 2009.","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"C. Avin, Z. Lotker, and Y. A. Pignolet. On the power of uniform power: Capacity of wireless networks with bounded resources. In Proceedings of the 17th Annual European Symposium on Algorithms (ESA), Copenhagen, Denmark, 2009.","DOI":"10.1007\/978-3-642-04128-0_34"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"D. Chafekar, V. S. Anil Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan. Cross-layer latency minimization in wireless networks with SINR con. In Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pages 110\u2013119, Montreal, Quebec, Canada, 2007.","DOI":"10.1145\/1288107.1288123"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"D. Chafekar, V. S. Anil Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan. Approximation algorithms for computing capacity of wireless networks with SINR constraints. In Proceedings of the 27th Conference of the IEEE Communications Society (INFOCOM), pages 1166\u20131174, Phoenix, AZ, USA, 2008.","DOI":"10.1109\/INFOCOM.2008.172"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"A. Fangh\u00e4nel, T. Kesselheim, H. R\u00e4cke, and B. V\u00f6cking. Oblivious interference scheduling. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), Calgary, Alberta, Canada, 2009.","DOI":"10.1145\/1582716.1582752"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"O. Goussevskaia, M. M. Halld\u00f3rsson, R. Wattenhofer, and E. Welzl. Capacity of arbitrary wireless networks. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), Rio de Janeiro, Brazil, 2009.","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"O. Goussevskaia, Y. A. Oswald, and R. Wattenhofer. Complexity in geometric SINR. In Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pages 100\u2013109, Montreal, Quebec, Canada, 2007.","DOI":"10.1145\/1288107.1288122"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In W. M. McEneaney, G. Yin, and Q. Zhang, editors, Stochastic Analysis, Control, Optimization, and Applications: A Volume in Honor of W. H. Fleming, Systems & Control: Foundations & Applications, pages 547\u2013566. Birkh\u00e4user, 1998.","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"M. M. Halld\u00f3rsson. Wireless scheduling with power control. In Proceedings of the 17th Annual European Symposium on Algorithms (ESA), Copenhagen, Denmark, 2009.","DOI":"10.1007\/978-3-642-04128-0_33"},{"key":"2_CR10","unstructured":"M. M. Halld\u00f3rsson and R. Wattenhofer. Computing Wireless Capacity. In press."},{"issue":"6","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/JSAC.2004.830909","volume":"22","author":"V. S. Anil Kumar","year":"2004","unstructured":"V. S. Anil Kumar, M. V. Marathe, S. Thite, H. Balakrishnan, C. L. Barrett. The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications, 22(6):1069\u20131079, 2004.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/B:WINE.0000028543.41559.ed","volume":"10","author":"R. Hekmat","year":"2004","unstructured":"R. Hekmat and P. Van Mieghem. Interference in wireless multi-hop ad-hoc networks and its effect on network capacity. Wireless Networks, 10(4):389\u2013399, 2004.","journal-title":"Wireless Networks"},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1023\/A:1012311216333","volume":"7","author":"S. O. Krumke","year":"2001","unstructured":"S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wireless Networks, 7(6):575\u2013584, 2001.","journal-title":"Wireless Networks"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"T. Moscibroda and R. Wattenhofer. The complexity of connectivity in wireless networks. In Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pages 1\u201313, Barcelona, Catalunya, Spain, 2006.","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"T. Moscibroda, R. Wattenhofer, and A. Zollinger. Topology control meets SINR: The scheduling complexity of arbitrary topologies. In Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pages 310\u2013321, Florence, Italy, 2006.","DOI":"10.1145\/1132905.1132939"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130\u2013143, 1988.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/144191.144283","volume":"22","author":"S. Ramanathan","year":"1992","unstructured":"S. Ramanathan and E. L. Lloyd. Scheduling algorithms for multi-hop radio networks. ACM SIGCOMM Computer Communication Review, 22(4):211\u2013222, 1992.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/293927.293928","volume":"28","author":"S. Singh","year":"1998","unstructured":"S. Singh and C. S. Raghavendra. PAMAS\u2014Power aware multi-access protocol with signalling for ad hoc networks. ACM SIGCOMM Computer Communication Review, 28(3):5\u201326, 1998.","journal-title":"ACM SIGCOMM Computer Communication Review"}],"container-title":["Monographs in Theoretical Computer Science. An EATCS Series","Theoretical Aspects of Distributed Computing in Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14849-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:50:40Z","timestamp":1676692240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14849-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,8]]},"ISBN":["9783642148484","9783642148491"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14849-1_2","relation":{},"ISSN":["1431-2654"],"issn-type":[{"type":"print","value":"1431-2654"}],"subject":[],"published":{"date-parts":[[2010,11,8]]},"assertion":[{"value":"8 November 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}