张宏扬，宁波大学

In this work, we mainly investigate the problem that minimizes the price function such that the valuation function exceeds a required threshold in submodular cover problem, where the price function is additive, and the valuation function is submodular. We study the problem under streaming model and propose bicriteria approximation algorithms. We find when the valuation function is no less than a threshold, the price function is no more than some bound κ. We also provide numerical experiments to measure the performance of our algorithm.