Author:
Hu Shuli,Li Ruizhi,Zhao Peng,Yin Minghao
Funder
National Natural Science Foundation of China
New Century Excellent Talents in University
Youth Foundation of Northeast Normal University
Publisher
Springer Science and Business Media LLC
Subject
Control and Optimization,General Computer Science
Reference30 articles.
1. Richter S, Helmert M, Gretton C (2007) A stochastic local search approach to vertex cover. In: Proceedings of KI-07, pp 412–426
2. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, pp 85–103
3. Wang Y, Cai S, Yin M (2016) Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of AAAI-16, pp 805–811
4. Cai S, Su K, Chen Q (2010) EWLS: a new local search for minimum vertex cover. In: Proceedings of AAAI-10, pp 45–50
5. Guo J, Niedermeier R, Wernicke S (2007) Parameterized complexity of vertex cover variants. Theory Comput Syst 41(3):501–520
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献