The Steiner tree packing problem in VLSI design (Q1373751): Difference between revisions

@@ Property / author @@
+Martin Grötschel
@@ Property / author: Martin Grötschel / rank @@
+Normal rank
@@ Property / author @@
+Alexander Martin
@@ Property / author: Alexander Martin / rank @@
+Normal rank
@@ Property / author @@
+Robert Weismantel
@@ Property / author: Robert Weismantel / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+BEAVER
@@ Property / describes a project that uses: BEAVER / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees: Polyhedral investigations
@@ Property / cites work: Packing Steiner trees: Polyhedral investigations / rank @@
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees: A cutting plane algorithm and computational results
+Normal rank
@@ Property / cites work @@
+Packing Steiner Trees: Separation Algorithms
@@ Property / cites work: Packing Steiner Trees: Separation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023738
@@ Property / cites work: Q4023738 / rank @@
+Normal rank