Approximating directed weighted-degree constrained networks
type: Item
instance of: scholarly article
title: Approximating directed weighted-degree constrained networks
zbMATH Open document ID: 1211.68018
author: Zeev Nutov
published in: Theoretical Computer Science
publication date: 2011-02-21T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5853821
zbMATH Keywords: directed network design
zbMATH Keywords: intersecting supermodular requirements
zbMATH Keywords: weighted degree constraints
zbMATH Keywords: bicriteria approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.11.043
OpenAlex ID: W2053342610
cites work: Small degree out‐branchings
cites work: Q5302102
cites work: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
cites work: Q4871749
cites work: Network Design with Weighted Degree Constraints
cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal
cites work: Q3140422
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
cites work: Survivable network design with degree or order constraints
cites work: Algorithms for a network design problem with crossing supermodular demands
cites work: Many birds with one stone
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
cites work: Approximating minimum bounded degree spanning trees to within one of optimal
DOI: 10.1016/J.TCS.2010.11.043
description: scientific article; zbMATH DE number 5853821