2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409): Difference between revisions

@@ Property / author @@
+I. I. Ëremin
@@ Property / author: I. I. Ëremin / rank @@
+Normal rank
@@ Property / author @@
+E. Kh. Gimadi
@@ Property / author: E. Kh. Gimadi / rank @@
+Normal rank
@@ Property / author @@
+Alexander Kel'Manov
@@ Property / author: Alexander Kel'Manov / rank @@
+Normal rank
@@ Property / author @@
+Artem V. Pyatkin
@@ Property / author: Artem V. Pyatkin / rank @@
+Normal rank
@@ Property / author @@
+Mikhail Yu. Khachay
@@ Property / author: Mikhail Yu. Khachay / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+An extended formulation approach to the edge-weighted maximal clique problem
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank