Local search with edge weighting and configuration checking heuristics for minimum vertex cover
From MaRDI portal
Publication:646517
Recommendations
- NuMVC: an efficient local search algorithm for minimum vertex cover
- Combining edge weight and vertex weight for minimum vertex cover problem
- An efficient local search framework for the minimum weighted vertex cover problem
- Towards faster local search for minimum weight vertex cover on massive graphs
- Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
Cites work
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1947416 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2243399 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- A novel evolutionary formulation of the maximum independent set problem
- A study of ACO capabilities for solving the maximum clique problem
- An ant colony optimization algorithm for the minimum weight vertex cover problem
- An exact algorithm for the maximum clique problem
- Approximating Maximum Clique by Removing Subgraphs
- Automata, Languages and Programming
- Clause weighting local search for SAT
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Handbook of knowledge representation.
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Local search algorithms for SAT: an empirical evaluation
- Local search: is brute-force avoidable?
- Many hard examples in exact phase transitions
- On the hardness of approximating minimum vertex cover
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Optimized Crossover for the Independent Set Problem
- Phased local search for the maximum clique problem
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Reactive local search for the maximum clique problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Some optimal inapproximability results
- Stochastic local search. Foundations and applications.
- Tabu Search—Part I
- Tabu Search—Part II
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Using constraint programming to solve the maximum clique problem
Cited in
(39)- Solving the set packing problem via a maximum weighted independent set heuristic
- MLQCC: an improved local search algorithm for the set k‐covering problem
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- scientific article; zbMATH DE number 6303718 (Why is no real title available?)
- Fairer comparisons for travelling salesman problem solutions using hash functions
- Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
- Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- On the parameterized vertex cover problem for graphs with perfect matching
- An efficient local search framework for the minimum weighted vertex cover problem
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
- New local search methods for partial MaxSAT
- Combining edge weight and vertex weight for minimum vertex cover problem
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- Towards faster local search for minimum weight vertex cover on massive graphs
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Local Search For Satisfiability Modulo Integer Arithmetic Theories
- 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
- Multi-neighborhood tabu search for the maximum weight clique problem
- The solution space structure of planted constraint satisfaction problems with growing domains
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- Local search for diversified top-\(k\) clique search problem
- An improved configuration checking-based algorithm for the unicost set covering problem
- Backdoors to tractable answer set programming
- Incremental Upper Bound for the Maximum Clique Problem
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- A review on algorithms for maximum clique problems
- NuMVC: an efficient local search algorithm for minimum vertex cover
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Complete Boolean satisfiability solving algorithms based on local search
- An efficient heuristic algorithm for solving connected vertex cover problem
This page was built for publication: Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646517)
