ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1402.0584
  4. Cited By
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

4 February 2014
Shaowei Cai
Kaile Su
Chuan Luo
A. Sattar
ArXivPDFHTML

Papers citing "NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover"

3 / 3 papers shown
Title
New Inference Rules for Max-SAT
New Inference Rules for Max-SAT
Chu Min Li
F. Manyà
Jordi Planes
FAtt
ReLM
LRM
60
174
0
31 Oct 2011
Dynamic Local Search for the Maximum Clique Problem
Dynamic Local Search for the Maximum Clique Problem
H. H. Hoos
W. Pullan
48
163
0
26 Sep 2011
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of
  Shared Resources
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources
L. Finkelstein
Shaul Markovitch
Ehud Rivlin
51
13
0
26 Jun 2011
1