Faster algorithm for optimum Steiner trees
type: Item
instance of: scholarly article
title: Faster algorithm for optimum Steiner trees
zbMATH Open document ID: 1260.68305
author: Jens Vygen
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6150494
zbMATH Keywords: graph algorithms
zbMATH Keywords: design of algorithms
zbMATH Keywords: Steiner tree problem
zbMATH Keywords: dynamic programming
zbMATH Keywords: tree composition
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.08.005
OpenAlex ID: W2078404396
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity
cites work: The steiner problem in graphs
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: Faster Steiner Tree Computation in Polynomial-Space
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Dynamic programming for minimum Steiner trees
cites work: Q4142699
cites work: Q5654074
cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
DOI: 10.1016/J.IPL.2011.08.005
description: scientific article; zbMATH DE number 6150494