Approximating the \(k\)-splittable capacitated network design problem
type: Item
instance of: scholarly article
title: Approximating the \(k\)-splittable capacitated network design problem
zbMATH Open document ID: 1387.90053
author: Ehab Morsy
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6872113
zbMATH Keywords: approximation algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: routing problems
zbMATH Keywords: network optimization
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.09.001
OpenAlex ID: W2526045693
cites work: Improved Approximation for Single-Sink Buy-at-Bulk
cites work: Approximating the single-sink link-installation problem in network design
cites work: Balancing minimum spanning trees and shortest-path trees
cites work: Approximation algorithms for a capacitated network design problem
cites work: An improved LP-based approximation for Steiner tree
cites work: The \(k\)-splittable flow problem
DOI: 10.1016/J.DISOPT.2016.09.001
description: scientific article; zbMATH DE number 6872113