Faster algorithm for optimum Steiner trees (Q1944205): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2011.08.005
@@ Property / DOI: 10.1016/j.ipl.2011.08.005 / 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.1016/j.ipl.2011.08.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2078404396
@@ Property / OpenAlex ID: W2078404396 / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+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 @@
+Faster Steiner Tree Computation in Polynomial-Space
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Dynamic programming for minimum Steiner trees
@@ Property / cites work: Dynamic programming for minimum Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5654074
@@ Property / cites work: Q5654074 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2011.08.005
@@ Property / DOI: 10.1016/J.IPL.2011.08.005 / rank @@
+Normal rank