{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:15:22Z","timestamp":1768281322066,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157622","type":"print"},{"value":"9783642157639","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_16","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T05:48:44Z","timestamp":1282628924000},"page":"163-178","source":"Crossref","is-referenced-by-count":42,"title":["Distributed Contention Resolution in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Kesselheim","sequence":"first","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, N.: The aloha system: another alternative for computer communications. In: AFIPS \u201970 (Fall): Proceedings of the Fall Joint Computer Conference, November 17-19, 1970, pp. 281\u2013285 (1970)","DOI":"10.1145\/1478462.1478502"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the sinr model: Complexity and game theory. In: Proceedings of the 28th Conference of the IEEE Communications Society, INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-04128-0_34","volume-title":"Algorithms - ESA 2009","author":"C. Avin","year":"2009","unstructured":"Avin, C., Lotker, Z., Pignolet, Y.A.: On the power of uniform power: Capacity of wireless networks with bounded resources. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 373\u2013384. Springer, Heidelberg (2009)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences\u00a045(1), 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: Proceedings of the 8thACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 110\u2013119 (2007)","DOI":"10.1145\/1288107.1288123"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On computing ad-hoc selective families. In: Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX), pp. 211\u2013222 (2001)","DOI":"10.1007\/3-540-44666-4_24"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Feige, U., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 162\u2013171 (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Fangh\u00e4nel, A., Kesselheim, T., R\u00e4cke, H., V\u00f6cking, B.: Oblivious interference scheduling. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 220\u2013229 (2009)","DOI":"10.1145\/1582716.1582752"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-02930-1_37","volume-title":"Automata, Languages and Programming","author":"A. Fangh\u00e4nel","year":"2009","unstructured":"Fangh\u00e4nel, A., Kesselheim, 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. LNCS, vol.\u00a05556, pp. 447\u2013458. Springer, Heidelberg (2009)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), New York, NY, USA, pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"key":"16_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 Transactions on Information Theory\u00a046, 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR12","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":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02927-1_44","volume-title":"Automata, Languages and Programming,","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 I, LNCS, vol.\u00a05555, pp. 525\u2013536. Springer, Heidelberg (2009)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. CoRR\u00a0abs\/1007.1611 (2010)","DOI":"10.1137\/1.9781611973082.120"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994)","DOI":"10.1007\/BF01215349"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pp. 1\u201313 (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R., Zollinger, A.: 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), pp. 310\u2013321 (2006)","DOI":"10.1145\/1132905.1132939"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1024916.1024920","volume":"5","author":"L.G. Roberts","year":"1975","unstructured":"Roberts, L.G.: Aloha packet system with and without slots and capture. SIGCOMM Comput. Commun. Rev.\u00a05(2), 28\u201342 (1975)","journal-title":"SIGCOMM Comput. Commun. Rev."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:41Z","timestamp":1606167581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}