Approximation algorithms for \(k\)-hurdle problems (Q627530): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-010-9408-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1979224980
@@ Property / OpenAlex ID: W1979224980 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing and covering a tree by subtrees
@@ Property / cites work: Packing and covering a tree by subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452913
@@ Property / cites work: Q4452913 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
+Normal rank
@@ Property / cites work @@
+Optimal 3-terminal cuts and linear programming
@@ Property / cites work: Optimal 3-terminal cuts and linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal attack and reinforcement of a network
@@ Property / cites work: Optimal attack and reinforcement of a network / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the minimum source-sink path subject to a budget constraint
+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 @@
+Multiway cuts in node weighted graphs
@@ Property / cites work: Multiway cuts in node weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+Approximating the <i>k</i>-multicut problem
@@ Property / cites work: Approximating the <i>k</i>-multicut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+Q4494412
@@ Property / cites work: Q4494412 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On budget-constrained flow improvement.
@@ Property / cites work: On budget-constrained flow improvement. / rank @@
+Normal rank
@@ Property / cites work @@
+The network inhibition problem
@@ Property / cites work: The network inhibition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint (<i>s, t</i>)‐cuts in a network
@@ Property / cites work: Disjoint (<i>s, t</i>)‐cuts in a network / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time simplex method for the maximum \(k\)-flow problem
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank