The minimum vulnerability problem (Q487032): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-014-9927-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2021441806
@@ Property / OpenAlex ID: W2021441806 / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Vulnerability Problem
@@ Property / cites work: The Minimum Vulnerability Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of Capacitated Network Design
@@ Property / cites work: Approximability of Capacitated Network Design / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design on Undirected Graphs
@@ Property / cites work: Capacitated Network Design on Undirected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On network design problems: fixed cost flows and the covering steiner problem
+Normal rank
@@ Property / cites work @@
+Finding paths with minimum shared edges
@@ Property / cites work: Finding paths with minimum shared edges / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+On Fixed Cost k-Flow Problems
@@ Property / cites work: On Fixed Cost k-Flow Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the covering Steiner problem
+Normal rank
@@ Property / cites work @@
+Q4494412
@@ Property / cites work: Q4494412 / rank @@
+Normal rank