Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem
type: Item
instance of: scholarly article
title: Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem
zbMATH Open document ID: 1024.90053
author: Dietmar Cieslik
author: Andreas W. M. Dress
author: Katharina T. Huber
author: Vincent Moulton
published in: Annals of Combinatorics
publication date: 2003-08-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1964604
zbMATH Keywords: discrete optimization
zbMATH Keywords: divide and conquer
zbMATH Keywords: dynamic programming
zbMATH Keywords: computational complexity
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: structural complexity
zbMATH Keywords: embedding complexity
zbMATH Keywords: treewidth
zbMATH Keywords: Steiner's problem
zbMATH Keywords: Steiner minimal trees
MaRDI profile type: MaRDI publication profile
full work available at URL: s000260200003
OpenAlex ID: W2048389490
DOI: 10.1007/S000260200003
Recommended article: Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
Recommended article: Q5689037
Recommended article: Dynamic programming for minimum Steiner trees
Recommended article: Improved Steiner Tree Algorithms for Bounded Treewidth
Recommended article: A Faster Algorithm for the Steiner Tree Problem
description: scientific article; zbMATH DE number 1964604