Local Search with Noisy Strategy for Minimum Vertex Cover in Massive Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Zongjie Ma, Yi Fan, Kaile Su, Chengqian Li, Abdul Sattar. Local Search with Noisy Strategy for Minimum Vertex Cover in Massive Graphs. In Richard Booth, Min-Ling Zhang, editors, PRICAI 2016: Trends in Artificial Intelligence - 14th Pacific Rim International Conference on Artificial Intelligence, Phuket, Thailand, August 22-26, 2016, Proceedings. Volume 9810 of Lecture Notes in Computer Science, pages 283-294, Springer, 2016. [doi]

The following publications are possibly variants of this publication:

EWLS: A New Local Search for Minimum Vertex CoverShaowei Cai, Kaile Su, Qingliang Chen. AAAI 2010: 45-50 [doi]

An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive GraphsYuanjie Li, Shaowei Cai, Wenying Hou. seal 2017: 145-157 [doi]

Towards faster local search for minimum weight vertex cover on massive graphsShaowei Cai, Yuanjie Li, Wenying Hou, Haoran Wang. isci, 471:64-79, 2019. [doi]

Local search with edge weighting and configuration checking heuristics for minimum vertex coverShaowei Cai, Kaile Su, Abdul Sattar. ai, 175(9-10):1672-1696, 2011. [doi]

Two New Local Search Strategies for Minimum Vertex CoverShaowei Cai, Kaile Su, Abdul Sattar. AAAI 2012: 441-447 [doi]

Improving Local Search for Minimum Weight Vertex Cover by Dynamic StrategiesShaowei Cai, Wenying Hou, Jinkun Lin, Yuanjie Li. IJCAI 2018: 1412-1418 [doi]

Minimum vertex cover in ball graphs through local searchZhao Zhang, Weili Wu, Lidan Fan, Ding-Zhu Du. jgo, 59(2-3):663-671, 2014. [doi]

runs on WebDSL