Minimax flow tree problems (Q3057112): Difference between revisions

@@ Property / cites work @@
+Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Approximating \(k\)-hop minimum-spanning trees
@@ Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Tree Spanners
@@ Property / cites work: Tree Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Network design for time‐constrained delivery
@@ Property / cites work: Network design for time‐constrained delivery / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
+Normal rank
@@ Property / cites work @@
+The 2-hop spanning tree problem
@@ Property / cites work: The 2-hop spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
+Normal rank
@@ Property / cites work @@
+On the minimum diameter spanning tree problem
@@ Property / cites work: On the minimum diameter spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Off-Line Maintenance of Planar Configurations
@@ Property / cites work: Off-Line Maintenance of Planar Configurations / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Diameter Spanning Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+Q2752462
@@ Property / cites work: Q2752462 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-source spanning trees: Algorithms for minimizing source eccentricities.
+Normal rank
@@ Property / cites work @@
+An Optimal Synchronizer for the Hypercube
@@ Property / cites work: An Optimal Synchronizer for the Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Shipment Routing Algorithms with Tree Constraints
@@ Property / cites work: Shipment Routing Algorithms with Tree Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the \(k\)-source maximum eccentricity spanning trees
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some optimum communication spanning tree problems
+Normal rank