Approximation algorithms for a capacitated network design problem
type: Item
instance of: scholarly article
title: Approximation algorithms for a capacitated network design problem
zbMATH Open document ID: 1138.90347
author: Refael Hassin
author: R. Ravi
author: F. Sibel Salman
published in: Algorithmica
publication date: 2004-09-22T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2101904
zbMATH Keywords: Network design
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Routing flow
zbMATH Keywords: Capacity installation
MaRDI profile type: Publication
full work available at URL: s00453-003-1069-7
OpenAlex ID: W2120679858
DOI: 10.1007/S00453-003-1069-7
Recommended article: Q2753737
Recommended article: Approximability of capacitated network design
Recommended article: Approximability of Capacitated Network Design
Recommended article: Approximation Algorithms for a Network Design Problem
Recommended article: Approximation algorithms for network design problems
Recommended article: Approximation Schemes for Capacitated Geometric Network Design
Recommended article: Approximation Algorithms for Network Design Problems on Bounded Subsets
Recommended article: Approximation algorithms for prize-collecting capacitated network design problems
Recommended article: Q4263723
description: scientific article; zbMATH DE number 2101904