Approximation and hardness results for label cut and related problems (Q630189): Difference between revisions

@@ Property / cites work @@
+Improved approximation for directed cut problems
@@ Property / cites work: Improved approximation for directed cut problems / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Spanning trees with many or few colors in edge-colored graphs
+Normal rank
@@ Property / cites work @@
+Q4659605
@@ Property / cites work: Q4659605 / rank @@
+Normal rank
@@ Property / cites work @@
+Local search for the minimum label spanning tree problem with bounded color classes.
+Normal rank
@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum labeling spanning trees
@@ Property / cites work: The minimum labeling spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating Multicut and Sparsest-Cut
+Normal rank
@@ Property / cites work @@
+Q3549612
@@ Property / cites work: Q3549612 / rank @@
+Normal rank
@@ Property / cites work @@
+On Labeled Traveling Salesman Problems
@@ Property / cites work: On Labeled Traveling Salesman Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating label-cover
@@ Property / cites work: On the hardness of approximating label-cover / rank @@
+Normal rank
@@ Property / cites work @@
+PCP characterizations of NP: toward a polynomially-small error-probability
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for labeled connectivity problems
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum label spanning tree problem
@@ Property / cites work: On the minimum label spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Least and most colored bases
@@ Property / cites work: Least and most colored bases / rank @@
+Normal rank
@@ Property / cites work @@
+The labeled perfect matching in bipartite graphs
@@ Property / cites work: The labeled perfect matching in bipartite graphs / 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
@@ Property / cites work @@
+Formal Methods for Components and Objects
@@ Property / cites work: Formal Methods for Components and Objects / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
+Normal rank