An Improved Approximate Greedy Algorithm for Vertex Covering-Reference-Cited by-同舟云学术

An Improved Approximate Greedy Algorithm for Vertex Covering

Published:2022-09-23 Issue: Volume: Page:
ISSN:
Container-title:2022 5th International Conference on Machine Learning and Machine Intelligence
language:
Short-container-title:

Author:

Yang Xiaojun¹^ORCID,Guo Lin²^ORCID,Li Lanxiang¹^ORCID

Affiliation:

1. Department of Information and Intelligent Engineering, Yunnan College of Business Management, China

2. Department of Computer and EEE, Oxbridge College, Kunming University of Science and Technology, China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3568199.3568212

Reference11 articles.

1. MarcoCesati . Compendium ofparameterizedproblems . 2006 . MarcoCesati. Compendium ofparameterizedproblems. 2006.

2. WANG Yong -fei, NING Ai -bing, CHEN Ji -zhen, HU Lin -lin, YANG Xiao -fang. Measure and Conquer Algorithm for Minimum Weighted Vertex Cover Problem . Journal of Chinese Computer Systems , 2015 , 36 ( 5 ): 1082 - 1084 . WANG Yong-fei, NING Ai-bing, CHEN Ji-zhen, HU Lin-lin, YANG Xiao-fang. Measure and Conquer Algorithm for Minimum Weighted Vertex Cover Problem. Journal of Chinese Computer Systems, 2015, 36 (5): 1082-1084.

3. Chen Zhi yun, Qu Huiqin , Lu Mingning , et a1. Apr—obabilistic parame— tetized algorithm for ve-rtex cover in stickermod, parallel and distributed processing symposium. Proceedings 18th International New York : IEEE Xplore , 2004 : l859-1862. Chen Zhi yun, Qu Huiqin, Lu Mingning, et a1. Apr—obabilistic parame— tetized algorithm for ve-rtex cover in stickermod, parallel and distributed processing symposium. Proceedings 18th International New York: IEEE Xplore, 2004: l859-1862.

4. A new technique for optimization problems in graph theory

5. Hybrid genetic algorithm for vertex cover problem;Cheng ZHOU;Computer Engineering and Applications,2007