On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
type: Item
instance of: scholarly article
title: On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
zbMATH Open document ID: 0952.68002
author: Bin Ma
author: Lusheng Wang
published in: Journal of Computer and System Sciences
publication date: 2000-05-08T00:00:00Z
Mathematics Subject Classification ID: 68M07
Mathematics Subject Classification ID: 68M99
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1441895
zbMATH Keywords: network optimization
MaRDI profile type: Publication
full work available at URL: jcss.1999.1661
OpenAlex ID: W1966838648
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
cites work: Q4142699
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Q4231910
cites work: Q4234048
cites work: Q3840354
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
DOI: 10.1006/JCSS.1999.1661
description: scientific article; zbMATH DE number 1441895