An approximation algorithm for maxk-uncut with capacity constraints (Q3225074): Difference between revisions

@@ Property / cites work @@
+A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
+Normal rank
@@ Property / cites work @@
+Q4251055
@@ Property / cites work: Q4251055 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for max<i>k</i>-uncut with capacity constraints
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank

An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074): Difference between revisions