NuMVC

swMATH8219MaRDI QIDQ20229FDOQ20229

Author name not available (Why is that?)

Described by source

• NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

Cited In (15)

• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
• \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
• An efficient local search framework for the minimum weighted vertex cover problem
• A New Solver for the Minimum Weighted Vertex Cover Problem
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
• Towards faster local search for minimum weight vertex cover on massive graphs
• Local search for Boolean satisfiability with configuration checking and subscore
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
• An improved configuration checking-based algorithm for the unicost set covering problem
• Backdoors to tractable answer set programming
• Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
• Can local optimality be used for efficient data reduction?
• An efficient heuristic algorithm for solving connected vertex cover problem

This page was built for software: NuMVC