The internal Steiner tree problem: Hardness and approximations
type: Item
instance of: scholarly article
title: The internal Steiner tree problem: Hardness and approximations
zbMATH Open document ID: 1256.68131
author: Chao-Wen Huang
author: Chia-Wei Lee
author: Huang-Ming Gao
author: Sun-Yuan Hsieh
published in: Journal of Complexity
publication date: 2013-01-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6125279
zbMATH Keywords: VLSI routing
zbMATH Keywords: approximation algorithms
zbMATH Keywords: MAX SNP-hardness
zbMATH Keywords: Steiner trees
zbMATH Keywords: the internal Steiner tree problem
zbMATH Keywords: design and analysis of algorithms
MaRDI profile type: Publication
full work available at URL: j.jco.2012.08.005
OpenAlex ID: W1967576404
DOI: 10.1016/J.JCO.2012.08.005
Recommended article: On the Internal Steiner Tree Problem
Recommended article: Approximating the selected-internal Steiner tree
Recommended article: Q3046489
Recommended article: Q4779183
Recommended article: The Steiner tree problem on graphs: inapproximability results
Recommended article: On the hardness of full Steiner tree problems
Recommended article: MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
Recommended article: Q4400842
Recommended article: The Clustered Selected-Internal Steiner Tree Problem
Recommended article: On the approximability of the Steiner tree problem.
description: scientific article; zbMATH DE number 6125279