Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792): Difference between revisions

@@ Property / author @@
-Walter Kern
@@ Property / author: Walter Kern / rank @@
-Normal rank
@@ Property / author @@
+Walter Kern
@@ Property / author: Walter Kern / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00186-007-0146-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2073517314
@@ Property / OpenAlex ID: W2073517314 / 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 @@
+On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4448761
@@ Property / cites work: Q4448761 / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner Minimal Trees with Rectilinear Distance
+Normal rank
@@ Property / cites work @@
+Q4945796
@@ Property / cites work: Q4945796 / rank @@
+Normal rank
@@ Property / cites work @@
+A catalog of Hanan grid problems
@@ Property / cites work: A catalog of Hanan grid problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2466792