The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725): Difference between revisions

@@ Property / cites work @@
+Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
+Normal rank
@@ Property / cites work @@
+Rectilinear steiner trees: Efficient special-case algorithms
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4136942
@@ Property / cites work: Q4136942 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank