{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:16:41Z","timestamp":1768677401911,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T00:00:00Z","timestamp":1433376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NNSF of China","doi-asserted-by":"crossref","award":["61373027"],"award-info":[{"award-number":["61373027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003091","name":"NSF of Shandong Province","doi-asserted-by":"crossref","award":["ZR2012FM023"],"award-info":[{"award-number":["ZR2012FM023"]}],"id":[{"id":"10.13039\/501100003091","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-015-9908-4","type":"journal-article","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T01:47:25Z","timestamp":1433382445000},"page":"1052-1067","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models"],"prefix":"10.1007","volume":"32","author":[{"given":"Cui","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Baogui","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Shanshan","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"issue":"6014","key":"9908_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1126\/science.1193210","volume":"331","author":"Y Afek","year":"2011","unstructured":"Afek Y, Alon N, Barad O, Hornstein E, Barkai N, Bar-Joseph Z (2011) A biological solution to a fundamental distributed computing problem. Science 331(6014):183\u2013185","journal-title":"Science"},{"issue":"6","key":"9908_CR2","doi-asserted-by":"crossref","first-page":"1701","DOI":"10.1109\/TNET.2010.2047511","volume":"18","author":"DM Blough","year":"2010","unstructured":"Blough DM, Resta G, Santi P (2010) Approximation algorithms for wireless link scheduling with SINR-based interference. IEEE\/ACM Trans Netw 18(6):1701\u20131712","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"9908_CR3","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s10878-013-9623-y","volume":"29","author":"Z Cai","year":"2015","unstructured":"Cai Z, Duan Y, Bourgeios A (2015) Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks. J Comb Optim 29(4):815\u2013835","journal-title":"J Comb Optim"},{"issue":"2","key":"9908_CR4","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.2007.913537","volume":"54","author":"P Chaporkar","year":"2008","unstructured":"Chaporkar P, Kar K, Luo X, Sarkar S (2008) Throughput and fairness guarantees through maximal scheduling in wireless networks. IEEE Trans Inf Theory 54(2):572\u2013594","journal-title":"IEEE Trans Inf Theory"},{"key":"9908_CR5","doi-asserted-by":"crossref","unstructured":"Chaorkar A, Proutiere P (2013) Optimal distributed scheduling in wireless networks under SINR interference model. arXiv:1305.038 [cs.IT]","DOI":"10.1109\/Allerton.2013.6736687"},{"key":"9908_CR6","doi-asserted-by":"crossref","unstructured":"Cheng S, Cai Z, Li J, et al. (2015) Drawing dominant dataset from big sensory data in wireless sensor networks. In: Proceedings of the IEEE INFOCOM 2015","DOI":"10.1109\/INFOCOM.2015.7218420"},{"issue":"2","key":"9908_CR7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1017\/S0001867800001075","volume":"38","author":"A Dimakis","year":"2006","unstructured":"Dimakis A, Walrand J (2006) Sufficient conditions for stability of longest queue first scheduling: second order properties using fluid limits. Adv Appl Probab 38(2):505\u2013521","journal-title":"Adv Appl Probab"},{"issue":"1","key":"9908_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/TWC.2003.819032","volume":"3","author":"T ElBatt","year":"2004","unstructured":"ElBatt T, Ephremides A (2004) Joint scheduling and power control for wireless ad hoc networks. IEEE Trans Wireless Commun 3(1):74\u201385","journal-title":"IEEE Trans Wireless Commun"},{"key":"9908_CR9","doi-asserted-by":"crossref","unstructured":"Gao J, Li J, Cai Z, Gao H (2015) Composite event coverage in wireless sensor networks with heterogeneous sensors. In: Proceedings of the IEEE INFOCOM 2015","DOI":"10.1109\/INFOCOM.2015.7218385"},{"key":"9908_CR10","first-page":"100","volume":"2007","author":"O Goussevskaia","year":"2007","unstructured":"Goussevskaia O, Oswald YV, Wattenhofer R (2007) Complexity in geometric SINR. Proc. ACM MobiHoc 2007:100\u2013109","journal-title":"Proc. ACM MobiHoc"},{"key":"9908_CR11","first-page":"1872","volume":"2009","author":"O Goussevskaia","year":"2009","unstructured":"Goussevskaia O, Wattenhofer R, Hallorsson MM, Welzl E (2009) Capacity of arbitrary wireless networks. Proc. IEEE INFOCOM 2009:1872\u20131880","journal-title":"Proc. IEEE INFOCOM"},{"key":"9908_CR12","doi-asserted-by":"publisher","unstructured":"Guo L, Li Y, Cai Z (2014) Minimum-latency aggregation scheduing in wireless sensor network. J Comb Optim. doi: 10.1007\/s10878-014-9748-7","DOI":"10.1007\/s10878-014-9748-7"},{"issue":"2","key":"9908_CR13","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P Gupta","year":"2000","unstructured":"Gupta P, Kumar PR (2000) The capacity of wireless networks. IEEE Trans Inf Theory 46(2):388\u2013404","journal-title":"IEEE Trans Inf Theory"},{"key":"9908_CR14","first-page":"625","volume":"2011","author":"MM Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson MM, Mitra P (2011) Nearly optimal bounds for distributed wireless scheduleing in the SINR model. Proc. ICALP 2011:625\u2013636","journal-title":"Proc. ICALP"},{"issue":"5","key":"9908_CR15","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/18.21215","volume":"34","author":"B Hajek","year":"1988","unstructured":"Hajek B, Sasaki G (1988) Link scheduling in ploynomial time. IEEE Trans Inf Theory 34(5):910\u2013917","journal-title":"IEEE Trans Inf Theory"},{"key":"9908_CR16","doi-asserted-by":"crossref","unstructured":"He Z, Cai Z, Cheng S, Wang X (2014) Approximate aggregation for tracking quantiles in wireless sensor networks. In: Proceedings of the COCOA 2014. LNCS 8881, pp 161\u2013172","DOI":"10.1007\/978-3-319-12691-3_13"},{"issue":"1","key":"9908_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10878-011-9446-7","volume":"26","author":"S Ji","year":"2013","unstructured":"Ji S, Uluagac A, Beyah R, Cai Z (2013) Practical unicast and convergecast scheduling schemes for cognitive radio networks. J Comb Optim 26(1):161\u2013177","journal-title":"J Comb Optim"},{"key":"9908_CR18","first-page":"1549","volume":"2011","author":"T Kesselheim","year":"2011","unstructured":"Kesselheim T (2011) A constant-factor approximation for wireless capacity maximization with power control in the SINR model. Proc. SODA 2011:1549\u20131559","journal-title":"Proc. SODA"},{"issue":"11","key":"9908_CR19","doi-asserted-by":"crossref","first-page":"3306","DOI":"10.1109\/TWC.2006.05058","volume":"5","author":"UC Kozat","year":"2006","unstructured":"Kozat UC, Koutsopoulos I (2006) Cross-layer desgin for power efficiency and Qos provisioning in multi-hop wireless networks. IEEE Trans Wireless Commun 5(11):3306\u20133315","journal-title":"IEEE Trans Wireless Commun"},{"issue":"6","key":"9908_CR20","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1109\/TNET.2010.2048338","volume":"18","author":"S Kompella","year":"2010","unstructured":"Kompella S, Wieselthier JE, Ephremides A, Sherali HD (2010) On optimal SINR-based scheduling in multihop wireless networks. IEEE\/ACM Trans Netw 18(6):1713\u20131724","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"9908_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10878-012-9504-9","volume":"27","author":"D Li","year":"2014","unstructured":"Li D, Zhu Q, Du H, Li J (2014) An improved distributed data aggregation scheduling in wireless sensor networks. J Comb Optim 27(2):221\u2013240","journal-title":"J Comb Optim"},{"key":"9908_CR22","first-page":"3853","volume":"2008","author":"Q Li","year":"2008","unstructured":"Li Q, Kim G, Negi R (2008) Maximal scheduling in a hypergraph model for wireless networks. Proc IEEE ICC 2008:3853\u20133857","journal-title":"Proc IEEE ICC"},{"issue":"1","key":"9908_CR23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TVT.2011.2176520","volume":"61","author":"Q Li","year":"2012","unstructured":"Li Q, Negi R (2012) Maximal scheduling in wireless ad hoc networks with hypergraph interference models. IEEE Trans Veh Technol 61(1):297\u2013310","journal-title":"IEEE Trans Veh Technol"},{"issue":"9","key":"9908_CR24","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/TCOM.1985.1096405","volume":"33","author":"R Nelson","year":"1985","unstructured":"Nelson R, Kleinrock L (1985) Spatial-TDMA: a collison-free multihop channel access protocol. IEEE Trans Commun 33(9):934\u2013944","journal-title":"IEEE Trans Commun"},{"key":"9908_CR25","first-page":"407","volume":"2012","author":"G Pei","year":"2012","unstructured":"Pei G, Kumar A, Vullikanti S (2012) Distributed algorithms for maximum link scheduling under the physical interference model. Proc DISC 2012:407\u2013408","journal-title":"Proc DISC"},{"key":"9908_CR26","unstructured":"Pei G, Anil Kumar VS (2012) Efficient algorithms for maximum link scheduling in distributed computing models with SINR contraints. arXiv:1208.0811v2 [cs.DC]16, Nov (2012)"},{"issue":"2","key":"9908_CR27","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/25.669084","volume":"47","author":"S Sarkar","year":"1998","unstructured":"Sarkar S, Sivarajan KN (1998) Hypergraph models for cellular mobile communication systems. IEEE Trans Veh Technol 47(2):460\u2013471","journal-title":"IEEE Trans Veh Technol"},{"key":"9908_CR28","doi-asserted-by":"crossref","unstructured":"Schmidt S, Wattenhofer R (2006) Algorithmic models for sensor networks. In: Proceedings of the IEEE IPDPS 2006","DOI":"10.1109\/IPDPS.2006.1639417"},{"key":"9908_CR29","first-page":"227","volume":"2006","author":"G Sharma","year":"2006","unstructured":"Sharma G, Mazumdar R, Shroff N (2006) On the complexity of scheduling in wireless networks. Proc ACM MobiCom 2006:227\u2013238","journal-title":"Proc ACM MobiCom"},{"key":"9908_CR30","first-page":"74","volume":"2010","author":"P Wan","year":"2010","unstructured":"Wan P, Xu X, Frieder O (2010) Shortest link scheduling with power control under physical interference model. Proc IEEE MSN 2010:74\u201378","journal-title":"Proc IEEE MSN"},{"key":"9908_CR31","doi-asserted-by":"crossref","unstructured":"Wan, P, Wang, L, Ma, C, Wang, Z, Xu, B, L, M (2013) Maximizing wireless network capacity with linear power: breaking the logarithmic barrier. In: Proceedings of the IEEE INFoCOM 2013, pp 135\u2013139","DOI":"10.1109\/INFCOM.2013.6566750"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9908-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9908-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9908-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9908-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T08:33:38Z","timestamp":1589531618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9908-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,4]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9908"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9908-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,4]]}}}