Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Liu, B.: Random Fuzzy Theory. Uncertainty Theory. Springer, Berlin (2004)
Ni, Y.: Minimum weight covering problems in stochastic environments. Inf. Sci. 214, 91–104 (2012)
Chen, L., Peng, J., Zhang, B., et al.: Uncertain programming model for uncertain minimum weight vertex covering problem. J. Intell. Manuf. 28(3), 625–632 (2017)
Xu, H., Kumar, T.K.S., Koenig, S.: A new solver for the minimum weighted vertex cover problem. In: International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming. Springer, Berlin (2016)
Zhao, H.H., Rosin, P., Lai, Y.K., Zheng, J.H., Wang, Y.N.: Adaptive gradient-based block compressive sensing with sparsity for noisy images. Multimed. Tools Appl. (2019)
Zhao, H.H., Rosin, P., Lai, Y.K.: Image neural network style transfer with global and local optimization fusion. IEEE Access (2019)
Zhao, H., Rosin, P.L., Lai, Y.K.: Automatic semantic style transfer using deep convolutional neural networks and soft masks. Vis. Comput. (2019)
Zhao, H.H., Liu, H.: Multiple classifiers fusion and CNN feature extraction for handwritten digits recognition. Granul. Comput. (2019)
Chen, L., Peng, J., Zhang, B. et al.: Uncertain programming model for uncertain minimum weight vertex covering problem. J. Intell. Manuf. (2017)
Goubko, M.: Minimizing wiener index for vertex-weighted trees with given weight and degree sequences. Mathematics 60(2), 2928–2937 (2015)
Lei, K., Cui, X.C., Chen, J.R.: Minimum vertex covering problem based on the shortest path algorithm. J. Lanzhou Jiaotong Univ. (2015)
Li, R., Hu, S., Zhang, H. et al.: An efficient local search framework for the minimum weighted vertex cover problem. Inf. Sci. 372(C), 428–445 (2016)
Acknowledgements
This work was supported by Science and Technology Plan Project of Hunan Province (2016TP1020), Application-oriented Special Disciplines Double First-Class University Project of Hunan Province (Xiangjiaotong [2018] 469).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, Y., Sun, Y., Liu, Q. (2021). Research on Algorithms for Setting up Advertising Platform Based on Minimum Weighted Vertex Covering. In: Liu, Q., Liu, X., Li, L., Zhou, H., Zhao, HH. (eds) Proceedings of the 9th International Conference on Computer Engineering and Networks . Advances in Intelligent Systems and Computing, vol 1143. Springer, Singapore. https://doi.org/10.1007/978-981-15-3753-0_46
Download citation
DOI: https://doi.org/10.1007/978-981-15-3753-0_46
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3752-3
Online ISBN: 978-981-15-3753-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)