{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:38Z","timestamp":1759847918159,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T00:00:00Z","timestamp":1505174400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201408330402"],"award-info":[{"award-number":["201408330402"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","award":["2016A610078"],"award-info":[{"award-number":["2016A610078"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"name":"K. C. Wong Magna Fund in the Ningbo University"},{"name":"FY16 Startup Funding of the Georgia Southern University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00453-017-0373-6","type":"journal-article","created":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T13:26:46Z","timestamp":1505222806000},"page":"3158-3176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Algorithms for Communication Scheduling in Data Gathering Network with Data Compression"],"prefix":"10.1007","volume":"80","author":[{"given":"Wenchang","family":"Luo","sequence":"first","affiliation":[]},{"given":"Yao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Boyuan","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Weitian","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-3396","authenticated-orcid":false,"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,12]]},"reference":[{"key":"373_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"IF Akyildiz","year":"2002","unstructured":"Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw. 38, 393\u2013422 (2002)","journal-title":"Comput. Netw."},{"key":"373_CR2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2006.05.037","volume":"181","author":"A Alfieri","year":"2007","unstructured":"Alfieri, A., Bianco, A., Brandimarte, P., Chiasserini, C.F.: Maximizing system lifetime in wireless sensor networks. Eur. J. Oper. Res. 181, 390\u2013402 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"373_CR3","first-page":"530","volume":"235","author":"J Berli\u0144ska","year":"2014","unstructured":"Berli\u0144ska, J.: Communication scheduling in data gathering networks with limited memory. Appl. Math. Comput. 235, 530\u2013537 (2014)","journal-title":"Appl. Math. Comput."},{"key":"373_CR4","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1016\/j.ejor.2015.05.026","volume":"246","author":"J Berli\u0144ska","year":"2015","unstructured":"Berli\u0144ska, J.: Scheduling for data gathering networks with data compression. Eur. J. Oper. Res. 246, 744\u2013749 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"373_CR5","volume-title":"Handbook on Scheduling: From Theory to Applications","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Berlin (2007)"},{"key":"373_CR6","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/TWC.2012.121412.120148","volume":"12","author":"J Cheng","year":"2013","unstructured":"Cheng, J., Ye, Q., Jiang, H., Wang, D., Wang, C.: Stcdg: an efficient data gathering algorithm based on matrix completion for wireless sensor networks. IEEE Trans. Wirel. Commun. 12, 850\u2013861 (2013)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"373_CR7","doi-asserted-by":"crossref","unstructured":"Choi, K., Robertazzi, T.G.: Divisible load scheduling in wireless sensor networks with information utility. In: Proceedings of the 2008 IEEE International Performance, Computing and Communications Conference, pp. 9\u201317 (2008)","DOI":"10.1109\/PCCC.2008.4745126"},{"key":"373_CR8","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1007\/s11276-009-0183-0","volume":"16","author":"SC Ergen","year":"2010","unstructured":"Ergen, S.C., Varaiya, P.: TDMA scheduling algorithms for wireless sensor networks. Wirel. Netw. 16, 985\u2013997 (2010)","journal-title":"Wirel. Netw."},{"key":"373_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"373_CR10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D Hochbaum","year":"1987","unstructured":"Hochbaum, D., Shmoys, D.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"373_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:JOCO.0000021934.29833.6b","volume":"8","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U.: Improved dynamic programming in connection with an FPTAS for the knapsack problem. J. Comb. Optim. 8, 5\u201311 (2004)","journal-title":"J. Comb. Optim."},{"key":"373_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"373_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ejor.2012.12.028","volume":"228","author":"H Kellerer","year":"2013","unstructured":"Kellerer, H., Strusevich, V.: Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product. Eur. J. Oper. Res. 228, 24\u201332 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"373_CR14","doi-asserted-by":"crossref","unstructured":"Kimura, N., Latifi, S.: A survey on data compression in wireless sensor networks. In: Proceedings of the 2005 International Conference on Information Technology: Coding and Computing, pp. 8\u201313 (2005)","DOI":"10.1109\/ITCC.2005.43"},{"key":"373_CR15","first-page":"7","volume":"20","author":"S Kumar","year":"2011","unstructured":"Kumar, S., Chauhan, S.: A survey on scheduling algorithms for wireless sensor networks. Int. J. Comput. Appl. 20, 7\u201313 (2011)","journal-title":"Int. J. Comput. Appl."},{"key":"373_CR16","doi-asserted-by":"crossref","unstructured":"Luo, C., Wu, F., Sun, J., Chen, C.W.: Compressive data gathering for large-scale wireless sensor networks. In: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, pp. 145\u2013156 (2009)","DOI":"10.1145\/1614320.1614337"},{"key":"373_CR17","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1109\/TAES.2006.1603426","volume":"42","author":"M Moges","year":"2006","unstructured":"Moges, M., Robertazzi, T.G.: Wireless sensor networks: scheduling for measurement and data reporting. IEEE Trans. Aerosp. Electron. Syst. 42, 327\u2013340 (2006)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"373_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ejor.2013.05.033","volume":"231","author":"A Rossi","year":"2013","unstructured":"Rossi, A., Singh, A., Sevaux, M.: Lifetime maximization in wireless directional sensor network. Eur. J. Oper. Res. 231, 229\u2013241 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"373_CR19","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1109\/TMC.2010.42","volume":"9","author":"L Shi","year":"2010","unstructured":"Shi, L., Fapojuwo, A.O.: TDMA scheduling with optimized energy efficiency and minimum delay in clustered wireless sensor networks. IEEE Trans. Mob. Comput. 9, 927\u2013940 (2010)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"373_CR20","unstructured":"Tauhidul, I.M.: Approximation Algorithms for Minimum Knapsack Problem. Master\u2019s thesis, University of Lethbridge (2009)"},{"key":"373_CR21","doi-asserted-by":"crossref","unstructured":"Wang, J., Tang, S., Yin, B., Li, X.Y.: Data gathering in wireless sensor networks through intelligent compressive sensing. In: INFOCOM 2012, pp. 603\u2013611 (2012)","DOI":"10.1109\/INFCOM.2012.6195803"},{"key":"373_CR22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1109\/TPDS.2009.45","volume":"21","author":"Y Wu","year":"2010","unstructured":"Wu, Y., Li, X.Y., Liu, Y., Lou, W.: Energy-efficient wake-up scheduling for data collection and aggregation. IEEE Trans. Parallel Distrib. Syst. 21, 275\u2013287 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"373_CR23","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1109\/TNET.2012.2229716","volume":"21","author":"L Xiang","year":"2013","unstructured":"Xiang, L., Luo, J., Rosenberg, C.: Compressed data aggregation: energy-efficient and high-fidelity data collection. IEEE\/ACM Trans. Netw. 21, 1722\u20131735 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"373_CR24","doi-asserted-by":"crossref","unstructured":"Xu, L., Wang, Y., Wang, Y.: Major coefficients recovery: a compressed data gathering scheme for wireless sensor network. In: Global Telecommunications Conference (GLOBECOM 2011), pp. 1\u20135 (2011)","DOI":"10.1109\/GLOCOM.2011.6134276"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0373-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0373-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0373-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T18:13:28Z","timestamp":1750875208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0373-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,12]]},"references-count":24,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0373-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,9,12]]}}}