Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517): Difference between revisions

@@ Property / cites work @@
+Optimized Crossover for the Independent Set Problem
+Normal rank
@@ Property / cites work @@
+A novel evolutionary formulation of the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+Reactive local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Q4411385
@@ Property / cites work: Q4411385 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Clique by Removing Subgraphs
+Normal rank
@@ Property / cites work @@
+Local search: is brute-force avoidable?
@@ Property / cites work: Local search: is brute-force avoidable? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part II
@@ Property / cites work: Tabu Search—Part II / rank @@
+Normal rank
@@ Property / cites work @@
+Q3184604
@@ Property / cites work: Q3184604 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple ingredients leading to very efficient heuristics for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
+Normal rank
@@ Property / cites work @@
+Local search algorithms for SAT: an empirical evaluation
+Normal rank
@@ Property / cites work @@
+Q5472387
@@ Property / cites work: Q5472387 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3623999
@@ Property / cites work: Q3623999 / rank @@
+Normal rank
@@ Property / cites work @@
+Phased local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+An ant colony optimization algorithm for the minimum weight vertex cover problem
+Normal rank
@@ Property / cites work @@
+A study of ACO capabilities for solving the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Clause weighting local search for SAT
@@ Property / cites work: Clause weighting local search for SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+Q5715715
@@ Property / cites work: Q5715715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954175
@@ Property / cites work: Q4954175 / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples in exact phase transitions
@@ Property / cites work: Many hard examples in exact phase transitions / rank @@
+Normal rank
@@ Property / cites work @@
+Random constraint satisfaction: easy generation of hard (satisfiable) instances
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank