Improved approximation algorithms for the single-sink buy-at-bulk network design problems
type: Item
instance of: scholarly article
title: Improved approximation algorithms for the single-sink buy-at-bulk network design problems
zbMATH Open document ID: 1184.68358
author: Raja Jothi
author: Balaji Raghavachari
published in: Journal of Discrete Algorithms
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5569521
zbMATH Keywords: single-sink buy-at-bulk
zbMATH Keywords: network design
zbMATH Keywords: approximation algorithms
zbMATH Keywords: randomized algorithms
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: j.jda.2008.12.003
OpenAlex ID: W2022174455
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Improved Approximation for Single-Sink Buy-at-Bulk
cites work: Q4537744
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: Algorithm Theory - SWAT 2004
cites work: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
cites work: Q4952699
cites work: Approximating the single-sink link-installation problem in network design
cites work: Q4737546
DOI: 10.1016/J.JDA.2008.12.003
description: scientific article; zbMATH DE number 5569521