{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:19:19Z","timestamp":1770491959167,"version":"3.49.0"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11704-022-1781-6","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T04:02:16Z","timestamp":1662523336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Boxiao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Mengting","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Haihang","family":"You","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"issue":"2","key":"1781_CR1","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/COMST.2017.2650979","volume":"19","author":"H Yetgin","year":"2017","unstructured":"Yetgin H, Cheung K T K, El-Hajjar M, Hanzo L H. A survey of network lifetime maximization techniques in wireless sensor networks. IEEE Communications Surveys & Tutorials, 2017, 19(2): 828\u2013854","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"1781_CR2","first-page":"472","volume-title":"Proceedings of IEEE International Conference on Communications","author":"S Slijepcevic","year":"2001","unstructured":"Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In: Proceedings of IEEE International Conference on Communications. 2001, 472\u2013476"},{"key":"1781_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1109\/TAAI.2012.39","volume-title":"Proceedings of 2012 Conference on Technologies and Applications of Artificial Intelligence","author":"C K Ting","year":"2012","unstructured":"Ting C K, Chou T M, Liao C C. Tabu search with random walk for lifetime extension in wireless sensor networks. In: Proceedings of 2012 Conference on Technologies and Applications of Artificial Intelligence. 2012, 119\u2013124"},{"issue":"8","key":"1781_CR4","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/TCYB.2017.2731598","volume":"48","author":"C C Liao","year":"2018","unstructured":"Liao C C, Ting C K. A novel integer-coded memetic algorithm for the set k-cover problem in wireless sensor networks. IEEE Transactions on Cybernetics, 2018, 48(8): 2245\u20132258","journal-title":"IEEE Transactions on Cybernetics"},{"key":"1781_CR5","doi-asserted-by":"publisher","first-page":"107473","DOI":"10.1016\/j.asoc.2021.107473","volume":"108","author":"M B Dowlatshahi","year":"2021","unstructured":"Dowlatshahi M B, Rafsanjani M K, Gupta B B. An energy aware grouping memetic algorithm to schedule the sensing activity in WSNs-based IoT for smart cities. Applied Soft Computing, 2021, 108: 107473","journal-title":"Applied Soft Computing"},{"issue":"1","key":"1781_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai S, Su K, Luo, Sattar A. NuMVC: an efficient local search algorithm for minimum vertex cover. Journal of Artificial Intelligence Research, 2013, 46(1): 687\u2013716","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-1781-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-022-1781-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-1781-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T20:27:04Z","timestamp":1721420824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-022-1781-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1781"],"URL":"https:\/\/doi.org\/10.1007\/s11704-022-1781-6","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,7]]},"assertion":[{"value":"28 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"173402"}}