Approximating the maximum vertex/edge weighted clique using local search (Q1009183): Difference between revisions

@@ Property / cites work @@
+A fast algorithm for the maximum weight clique problem
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Annealed replication: A new heuristic for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q5687246
@@ Property / cites work: Q5687246 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of tabu search heuristic for the maximum edge-weighted subgraph problem
+Normal rank
@@ Property / cites work @@
+The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
+Normal rank
@@ Property / cites work @@
+Phased local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q3623999
@@ Property / cites work: Q3623999 / rank @@
+Normal rank