Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
type: Item
instance of: scholarly article
title: Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
zbMATH Open document ID: 1176.68242
author: Mohammad T. Hajiaghayi
author: Guy Kortsarz
author: Mohammad Salavatipour
published in: Algorithmica
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5553462
zbMATH Keywords: network design problems
zbMATH Keywords: cost functions
MaRDI profile type: Publication
full work available at URL: s00453-007-9013-x
OpenAlex ID: W2098907131
cites work: Approximation algorithms for access network design
cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
cites work: Generalized submodular cover problems and applications
cites work: Q4542533
cites work: Q4228499
cites work: On non-uniform multicommodity buy-at-bulk network design
cites work: A deterministic algorithm for the cost-distance problem
cites work: On the approximability of some network design problems
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: The dense \(k\)-subgraph problem
cites work: Saving an epsilon
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: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
cites work: Approximation Schemes for the Restricted Shortest Path Problem
cites work: Q4411286
cites work: Approximation algorithms for combinatorial problems
cites work: Bicriteria Network Design Problems
cites work: Cost-Distance: Two Metric Network Design
cites work: Approximating the single-sink link-installation problem in network design
DOI: 10.1007/S00453-007-9013-X
description: scientific article; zbMATH DE number 5553462