Faster algorithm for optimum Steiner trees
From MaRDI portal
Publication:1944205
DOI10.1016/j.ipl.2011.08.005zbMath1260.68305MaRDI QIDQ1944205
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.08.005
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The Steiner problem with edge lengths 1 and 2
- Dynamic programming for minimum Steiner trees
- Faster Steiner Tree Computation in Polynomial-Space
- Fourier meets M\"{o}bius: fast subset convolution
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Fibonacci heaps and their uses in improved network optimization algorithms
- The steiner problem in graphs