Towards faster local search for minimum weight vertex cover on massive graphs-Reference-Cited by-同舟云学术

Towards faster local search for minimum weight vertex cover on massive graphs

Published:2019-01 Issue: Volume:471 Page:64-79
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Cai Shaowei^ORCID,Li Yuanjie,Hou Wenying,Wang Haoran

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference20 articles.

1. A population-based iterated greedy algorithm for the minimum weight vertex cover problem;Bouamama;Appl. Soft Comput.,2012

2. Balance between complexity and quality: local search for minimum vertex cover in massive graphs;Cai,2015

3. NuMVC: an efficient local search algorithm for minimum vertex cover;Cai;J. Artif. Intell. Res.,2013

4. Local search with edge weighting and configuration checking heuristics for minimum vertex cover;Cai;Artif. Intell.,2011

5. A greedy heuristic for the set-covering problem;Chvatal;Math. Oper. Res.,1979

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Local Search Algorithm with Vertex Weighting Strategy and Two-Level Configuration Checking for the Minimum Connected Dominating Set Problem;Biomimetics;2024-07-15

2. A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem;Neural Computing and Applications;2024-04-29

3. An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks;Algorithms;2024-02-06

4. Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs;Mathematical Structures in Computer Science;2024-01-10

5. A new local search algorithm with greedy crossover restart for the dominating tree problem;Expert Systems with Applications;2023-11