{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T12:21:47Z","timestamp":1774354907366,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12461059"],"award-info":[{"award-number":["12461059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00224-026-10272-z","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:04:12Z","timestamp":1774350252000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for the Online Power Cover Problem on a Line"],"prefix":"10.1007","volume":"70","author":[{"given":"Xiaofei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinlin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonghao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,24]]},"reference":[{"key":"10272_CR1","doi-asserted-by":"crossref","unstructured":"Cai, Z., Chen, Q.: Latency-and-coverage aware data aggregation scheduling for multihop battery-free wireless networks. IEEE Trans. Wire. Commun., (20\u20133) (2021)","DOI":"10.1109\/TWC.2020.3036408"},{"issue":"6","key":"10272_CR2","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."},{"key":"10272_CR3","doi-asserted-by":"crossref","unstructured":"Bilo, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Algorithms-ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3\u20136, 2005. Proceedings 13, pp. 460\u2013471 (2005). Springer","DOI":"10.1007\/11561071_42"},{"key":"10272_CR4","doi-asserted-by":"crossref","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S., Whittlesey, K.: 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"},{"issue":"4","key":"10272_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."},{"key":"10272_CR6","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."},{"issue":"3","key":"10272_CR7","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":"10272_CR8","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 (2021). SIAM","DOI":"10.1137\/1.9781611976465.53"},{"issue":"6","key":"10272_CR9","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). SCIENTIA SINICA Informationis 52(6), 947\u2013959 (2022)","journal-title":"SCIENTIA SINICA Informationis"},{"key":"10272_CR10","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10898-021-01033-y","volume":"80","author":"Y Ran","year":"2021","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, 661\u2013677 (2021)","journal-title":"J. Global Optim."},{"key":"10272_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-030-52824-9","volume-title":"Optimal Coverage in Wireless Sensor Networks","author":"W Wu","year":"2020","unstructured":"Wu, W., Zhang, Z., Lee, W., Du, D.-Z.: Optimal Coverage in Wireless Sensor Networks, 1st edn., p. 297. Springer, Cham, Switzerland (2020)","edition":"1"},{"key":"10272_CR12","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."},{"key":"10272_CR13","doi-asserted-by":"publisher","unstructured":"Zhang, H., Zheng, X., Liu, Z., Liu, X.: The $$k$$-prize-collecting coverage problem by aligned disks. Int. Trans. Opera. Res. (2025). https:\/\/doi.org\/10.1111\/itor.13608","DOI":"10.1111\/itor.13608"},{"key":"10272_CR14","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 (2024). Springer","DOI":"10.1007\/978-981-97-7801-0_11"},{"issue":"4","key":"10272_CR15","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":"10272_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Z., Xiao, M., Liu, X., Li, W.: The online power cover problem on a line. In: International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom, pp. 142\u2013151 (2025). Springer","DOI":"10.1007\/978-981-96-8312-3_11"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10272-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10272-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10272-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:04:15Z","timestamp":1774350255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10272-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,24]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10272"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10272-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,24]]},"assertion":[{"value":"22 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}