Research on Algorithms for Setting up Advertising Platform Based on Minimum Weighted Vertex Covering

A classical problem in combinatorial optimization is the minimum weighted vertex covering problem. In practical applications, the weights on vertices are usually composed of some uncertain factors. This paper combines the stochastic fuzzy theory, uses the backtracking method to search subset tree to solve the minimum weighted vertex covering, and finally obtains the key points of setting up the advertising platform and solves the problem of how to set up the advertising platform reasonably under the stochastic fuzzy uncertain environment.