Complexity of the min-max (regret) versions of min cut problems (Q924631): Difference between revisions

@@ Property / cites work @@
+Approximation of min-max and min-max regret versions of some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+Multicriteria global minimum cuts
@@ Property / cites work: Multicriteria global minimum cuts / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140397
@@ Property / cites work: Q3140397 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the minimum cut problem
@@ Property / cites work: A new approach to the minimum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Computing All Small Cuts in an Undirected Network
@@ Property / cites work: Computing All Small Cuts in an Undirected Network / rank @@
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank