Approximation algorithm of maximizing non-submodular functions under non-submodular constraint

Nowadays, maximizing the non-negative and non-submodular objective functions under Knapsack constraint or Cardinality constraint is deeply researched. Nevertheless, few studies study the objective functions with non-submodularity under the nonsubmodular constraint. And there are many practical applications of the situations, such as Epidemic transmission, and Sensor Placement and Feature Selection problem. In this paper, we study the maximization of the non-submodular objective functions under the non-submodular constraint. Based on the non-submodular constraint, we discuss the maximization of the objective functions with some specific properties, which includes the property of negative, and then, we obtain the corresponding approximate ratios by the greedy algorithm. What is more, these approximate ratios could be improved when the constraint becomes tight.