Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376): Difference between revisions

@@ Property / cites work @@
+Length-Bounded Cuts and Flows
@@ Property / cites work: Length-Bounded Cuts and Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q4509380
@@ Property / cites work: Q4509380 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of vertex-disjoint length-restricted path problems
+Normal rank
@@ Property / cites work @@
+A counterexample to a conjecture on paths of bounded length
+Normal rank
@@ Property / cites work @@
+Q4840098
@@ Property / cites work: Q4840098 / rank @@
+Normal rank
@@ Property / cites work @@
+On the directed hop-constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+A note on hop-constrained walk polytopes.
@@ Property / cites work: A note on hop-constrained walk polytopes. / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral Characterization of Discrete Dynamic Programming
+Normal rank
@@ Property / cites work @@
+On line disjoint paths of bounded length
@@ Property / cites work: On line disjoint paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Quickest Flows Over Time
@@ Property / cites work: Quickest Flows Over Time / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+A generalization of max flow—min cut
@@ Property / cites work: A generalization of max flow—min cut / rank @@
+Normal rank
@@ Property / cites work @@
+The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
+Normal rank
@@ Property / cites work @@
+Integer programming formulations for the two 4-hop-constrained paths problem
+Normal rank
@@ Property / cites work @@
+Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+Normal rank
@@ Property / cites work @@
+Mengerian theorems for paths of bounded length
@@ Property / cites work: Mengerian theorems for paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity network flow with jump constraints
@@ Property / cites work: Multicommodity network flow with jump constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q4182218
@@ Property / cites work: Q4182218 / rank @@
+Normal rank