Publisher
Springer Nature Singapore
Reference10 articles.
1. Bandyapadhyay, S., Bhowmick, S., Inamdar, T., Varadarajan.: Capacitated covering problems in geometric spaces. Discrete Comput. Geom. 63(4), 768–798(2020)
2. Bandyapadhyay, S.: Improved bounds for metric capacitated covering problems. arXiv preprint arXiv:2006.12454(2020)
3. Dai, H., Deng, B., Li, W., Liu, X.: A note on the minimum power partial cover problem on the plane. J. Comb. Optim. 44(2), 970–978 (2022)
4. Li, M., Ran, Y., Zhang, Z.: A primal-dual algorithm for the minimum power partial cover problem. J. Comb. Optim. 39, 725–746 (2020). https://doi.org/10.1007/s10878-020-00567-3
5. Liang, W., Li, M., Zhang, Z., Huang, X.: Minimum power partial multi-cover on a line. Theor. Comput. Sci. 864, 118–128 (2021)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Approximation Algorithm for Stochastic Power Cover Problem;Communications in Computer and Information Science;2023-11-26