{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T18:21:02Z","timestamp":1776277262514,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146534","type":"print"},{"value":"9783642146541","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14654-1_8","type":"book-chapter","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T04:02:22Z","timestamp":1282190542000},"page":"68-74","source":"Crossref","is-referenced-by-count":13,"title":["Maximum Weighted Independent Set of Links under Physical Interference Model"],"prefix":"10.1007","author":[{"given":"Xiaohua","family":"Xu","sequence":"first","affiliation":[]},{"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Brar, G., Blough, D., Santi, P.: Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks. In: ACM MobiCom (2006)","DOI":"10.1145\/1161089.1161092"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. In: IEEE INFOCOM, pp. 1166\u20131174 (2008)","DOI":"10.1109\/INFOCOM.2008.172"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Cruz, R., Santhanam, A.: Optimal routing, link scheduling and power control in multihop wireless networks. In: IEEE INFOCOM, vol.\u00a01 (2003)","DOI":"10.1109\/INFCOM.2003.1208720"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TWC.2003.819032","volume":"1","author":"T. ElBatt","year":"2004","unstructured":"ElBatt, T., Ephremides, A.: Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communications\u00a01, 74\u201385 (2004)","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Sharma, G., Joo, C., Shroff, N.: Distributed scheduling schemes for throughput guarantees in wireless networks. In: Allerton 2006 (2006)","DOI":"10.1109\/INFCOM.2007.240"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y., Wattenhofer, R.: Complexity in geometric SINR. In: Proceedings of ACM MobiHoc, pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Wattenhofer, R., Halld\u00f3rsson, M.M., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: IEEE INFOCOM 2009 (2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"8_CR8","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. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.: Wireless scheduling with power control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 361\u2013372. Springer, Heidelberg (2009)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Halldorsson, M., Wattenhofer, R.: Wireless Communication is in APX. In: Automata, Languages and Programming, pp. 525\u2013536","DOI":"10.1007\/978-3-642-02927-1_44"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Joo, C., Shroff, N.: Performance of random access scheduling schemes in multi-hop wireless networks. In: IEEE INFOCOM (2007)","DOI":"10.1109\/INFCOM.2007.11"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Lin, X., Rasool, S.: Constant-time distributed scheduling policies for ad hoc wireless networks. In: IEEE CDC (2006)","DOI":"10.1109\/CDC.2006.376968"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: IEEE INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"8_CR13","unstructured":"Penttinen, A., Koutsopoulos, I., Tassiulas, L.: Low-complexity distributed fair scheduling for wireless multi-hop networks. In: WiOPT 2005: First Workshop on Resource Allocation in Wireless Networks, RAWNET (2005)"},{"key":"8_CR14","first-page":"313","volume-title":"ACM SIGMETRICS","author":"S. Sanghavi","year":"2007","unstructured":"Sanghavi, S., Bui, L., Srikant, R.: Distributed link scheduling with constant overhead. In: ACM SIGMETRICS, pp. 313\u2013324. ACM Press, New York (2007)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-03417-6_17","volume-title":"WASA 2009","author":"P. Wan","year":"2009","unstructured":"Wan, P., Jia, X., Yao, F.: Maximum Independent Set of Links under Physical Interference Model. In: Liu, B., Bestavros, A., Du, D.-Z., Wang, J. (eds.) WASA 2009. LNCS, vol.\u00a05682, pp. 169\u2013178. Springer, Heidelberg (2009)"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1540343.1540347","volume-title":"Proceedings of the 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing","author":"X. Xu","year":"2009","unstructured":"Xu, X., Tang, S.: A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model. In: Proceedings of the 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, pp. 13\u201320. ACM, New York (2009)"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14654-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T10:24:13Z","timestamp":1636194253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14654-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146534","9783642146541"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14654-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}