Definition and algorithms for reliable Steiner tree problem
type: Item
instance of: scholarly article
title: Definition and algorithms for reliable Steiner tree problem
zbMATH Open document ID: 1321.05277
author: Yaohua Tang
author: Wenguo Yang
author: Tiande Guo
published in: Journal of Systems Science and Complexity
publication date: 2015-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6485585
zbMATH Keywords: approximation algorithm
zbMATH Keywords: exact algorithm
zbMATH Keywords: reliability
zbMATH Keywords: Steiner tree
MaRDI profile type: Publication
full work available at URL: s11424-014-2120-2
OpenAlex ID: W2044301172
cites work: Reducibility among Combinatorial Problems
cites work: Q3874241
cites work: An 11/6-approximation algorithm for the network Steiner problem
cites work: Improved Approximations for the Steiner Tree Problem
cites work: RNC-approximation algorithms for the steiner problem
cites work: New approximation algorithms for the Steiner tree problems
cites work: Q4252319
cites work: Tighter Bounds for Graph Steiner Tree Approximation
cites work: An improved LP-based approximation for Steiner tree
cites work: The steiner problem in graphs
cites work: A probably fast, provably optimal algorithm for rectilinear Steiner trees
cites work: Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
cites work: Algorithms and Data Structures
cites work: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
cites work: A Faster Algorithm for the Steiner Tree Problem
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
DOI: 10.1007/S11424-014-2120-2
description: scientific article; zbMATH DE number 6485585