Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+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 @@
+The minimum labeling spanning trees
@@ Property / cites work: The minimum labeling spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete particle swarm optimization for the minimum labelling Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Labeled traveling salesman problems: complexity and approximation
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of some minimum label problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for labeled connectivity problems
+Normal rank
@@ Property / cites work @@
+Graph cuts with interacting edge weights: examples, approximations, and algorithms
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+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 @@
+The labeled perfect matching in bipartite graphs
@@ Property / cites work: The labeled perfect matching in bipartite graphs / 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 @@
+Approximating Minimum Label s-t Cut via Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / cites work @@
+The Colorful Traveling Salesman Problem
@@ Property / cites work: The Colorful Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and hardness results for label cut and related problems
+Normal rank