{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:21:46Z","timestamp":1777497706457,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819683116","type":"print"},{"value":"9789819683123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-8312-3_11","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:14:54Z","timestamp":1751192094000},"page":"142-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Online Power Cover Problem on\u00a0a\u00a0Line"],"prefix":"10.1007","author":[{"given":"Zhonghao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Man","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Xiaofei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., et al.: Minimum-cost coverage of point sets by disks. In: Proceedings of the Twenty-second Annual Symposium on Computational Geometry, pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 460\u2013471. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_42","DOI":"10.1007\/11561071_42"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Cai, Z., Chen, Q.: Latency-and-coverage aware data aggregation scheduling for multihop battery-free wireless networks. IEEE Trans. Wireless Commun. 20(3), 1770\u20131784 (2021)","DOI":"10.1109\/TWC.2020.3036408"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Huang, Z., Feng, Q., Wang, J., Xu, J.: PTAS for minimum cost multi-covering with disks. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 840\u2013859. SIAM (2021)","DOI":"10.1137\/1.9781611976465.53"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1007\/s10878-020-00567-3","volume":"44","author":"M Li","year":"2022","unstructured":"Li, M., Ran, Y., Zhang, Z.: A primal-dual algorithm for the minimum power partial cover problem. J. Comb. Optim. 44(3), 1913\u20131923 (2022)","journal-title":"J. Comb. Optim."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2021.02.033","volume":"864","author":"W Liang","year":"2021","unstructured":"Liang, W., Li, M., Zhang, Z., Huang, X.: Minimum power partial multi-cover on a line. Theoret. Comput. Sci. 864, 118\u2013128 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1360\/SSI-2021-0445","volume":"52","author":"X Liu","year":"2022","unstructured":"Liu, X., Dai, H., Li, S., Li, W.: $$k$$-prize-collecting minimum power cover problem with submodular penalties on a plane (in Chinese). Sci .Sinica Inf. 52(6), 947\u2013959 (2022)","journal-title":"Sci .Sinica Inf."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2022.05.012","volume":"923","author":"X Liu","year":"2022","unstructured":"Liu, X., Li, W., Dai, H.: Approximation algorithms for the minimum power cover problem with submodular\/linear penalties. Theoret. Comput. Sci. 923, 256\u2013270 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Ran, Y., Huang, X., Zhang, Z., Du, D.-Z.: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Global Optim. 80(3), 661\u2013677 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01033-y","DOI":"10.1007\/s10898-021-01033-y"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Optimal coverage in wireless Sensor Networks. SOIA, vol. 162. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52824-9_9","DOI":"10.1007\/978-3-030-52824-9_9"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Xiao, M., Li, W.: Online bottleneck matching on a star. In: International Conference on Algorithmic Aspects in Information and Management, pp. 123\u2013133. Springer (2024)","DOI":"10.1007\/978-981-97-7801-0_11"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s10878-023-01036-3","volume":"45","author":"M Xiao","year":"2023","unstructured":"Xiao, M., Zhao, S., Li, W., Yang, J.: Online bottleneck matching on a line. J. Comb. Optim. 45(4), 108 (2023)","journal-title":"J. Comb. Optim."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zheng, X., Liu, Z., Liu, X.: The $$k$$-prize-collecting coverage problem by aligned disks. Int. Trans. Oper. Res. (2025). https:\/\/doi.org\/10.1111\/itor.13608","DOI":"10.1111\/itor.13608"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","first-page":"3620","DOI":"10.1109\/TNET.2016.2531688","volume":"24","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Willson, J., Lu, Z., Wu, W., Zhu, X.: Approximating maximum lifetime $$k$$ -coverage through minimizing weighted $$k$$-cover in homogeneous wireless sensor networks. IEEE\/ACM Trans. Netw. 24(6), 3620\u20133633 (2016)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8312-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:14:56Z","timestamp":1751192096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8312-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819683116","9789819683123"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8312-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs-faw.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}