A note on the subadditive network design problem
type: Item
instance of: scholarly article
title: A note on the subadditive network design problem
zbMATH Open document ID: 1173.90334
published in: Operations Research Letters
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5634571
zbMATH Keywords: approximation algorithm
zbMATH Keywords: network design
zbMATH Keywords: hardness of approximation
zbMATH Keywords: subadditive cost function
author: MohammadHossein Bateni
author: Mohammad T. Hajiaghayi
MaRDI profile type: Publication
full work available at URL: j.orl.2009.05.006
OpenAlex ID: W2117719091
cites work: Network design for information networks
cites work: Q4763416
cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
cites work: Stochastic Steiner Tree with Non-uniform Inflation
cites work: On the hardness of approximating spanners
cites work: On the hardness of approximating minimization problems
cites work: On the hardness of approximating label-cover
cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations
cites work: Q4234093
cites work: A constant factor approximation for the single sink edge installation problems
cites work: Simpler and better approximation algorithms for network design
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Steiner points in tree metrics don't (really) help
DOI: 10.1016/J.ORL.2009.05.006
description: scientific article; zbMATH DE number 5634571