Approximating bounded-degree spanning trees and connected factors with leaves
type: Item
instance of: scholarly article
title: Approximating bounded-degree spanning trees and connected factors with leaves
zbMATH Open document ID: 1409.05198
author: Walter Kern
author: Bodo Manthey
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
full work available at URL: approximating-boundeddegree-spanning-trees-and-connected-factors-with-leaves(0518192b-c521-4eb5-a67c-ea0d08a14aa0).html
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7027500
zbMATH Keywords: approximation algorithms
zbMATH Keywords: bounded-degree spanning trees
zbMATH Keywords: connected graph factors
zbMATH Keywords: network design
MaRDI profile type: Publication
OpenAlex ID: W2577535483
cites work: Q3056948
cites work: Degree Bounded Network Design with Metric Costs
cites work: The complexity of regular subgraph recognition
cites work: Approximation Algorithms for Network Design with Metric Costs
cites work: Approximation algorithms for connected graph factors of minimum weight
cites work: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
cites work: Network design with edge-connectivity and degree constraints
cites work: Network design with weighted degree constraints
cites work: Q4198056
cites work: On some network design problems with degree constraints
cites work: Biconnectivity approximations and graph carvings
cites work: Approximating node connectivity problems via set covers
cites work: Survivable Network Design with Degree or Order Constraints
cites work: Additive Approximation for Bounded Degree Survivable Network Design
cites work: A Unified Algorithm for Degree Bounded Survivable Network Design
cites work: Matching theory
cites work: Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
cites work: A Short Proof of the Factor Theorem for Finite Graphs
cites work: The Design of Approximation Algorithms
DOI: 10.1016/J.ORL.2017.01.002
description: scientific article; zbMATH DE number 7027500