ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272): Difference between revisions

@@ Property / author @@
-Anders Dessmark
@@ Property / author: Anders Dessmark / rank @@
-Normal rank
@@ Property / author @@
-Andrzej Lingas
@@ Property / author: Andrzej Lingas / rank @@
-Normal rank
@@ Property / author @@
+Anders Dessmark
@@ Property / author: Anders Dessmark / rank @@
+Normal rank
@@ Property / author @@
+Andrzej Lingas
@@ Property / author: Andrzej Lingas / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054107004656
+Normal rank
@@ Property / OpenAlex ID @@
+W2013850148
@@ Property / OpenAlex ID: W2013850148 / rank @@
+Normal rank