Differential approximation results for the Steiner tree problem
type: Item
instance of: scholarly article
title: Differential approximation results for the Steiner tree problem
zbMATH Open document ID: 1046.90096
DOI: 10.1016/S0893-9659(03)00075-2
author: Jérôme Monnot
author: Vangelis Th. Paschos
author: Marc Demange
published in: Applied Mathematics Letters
publication date: 2004-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2073734
zbMATH Keywords: algorithmical approximation
zbMATH Keywords: Algorithms
zbMATH Keywords: Complexity
MaRDI profile type: Publication
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Q4198056
cites work: An 11/6-approximation algorithm for the network Steiner problem
cites work: Improved Approximations for the Steiner Tree Problem
cites work: New approximation algorithms for the Steiner tree problems
cites work: Q4952699
cites work: Q4779183
cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Optimization, approximation, and complexity classes
description: scientific article; zbMATH DE number 2073734