Refuting a conjecture of goemans on bounded degree spanning trees
type: Item
instance of: scholarly article
title: Refuting a conjecture of goemans on bounded degree spanning trees
zbMATH Open document ID: 1408.90294
author: Rico Zenklusen
author: Stephen R. Chestnut
author: Martin Nägele
published in: Operations Research Letters
publication date: 2019-01-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7002347
zbMATH Keywords: bounded degree spanning tree
zbMATH Keywords: approximation algorithm
zbMATH Keywords: matroid
MaRDI profile type: Publication
full work available at URL: j.orl.2016.09.014
OpenAlex ID: W2529324002
Wikidata QID: Q123224189
cites work: On generalizations of network design problems with degree bounds
cites work: Additive Guarantees for Degree-Bounded Directed Network Design
cites work: A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
cites work: What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal
cites work: A matter of degree
cites work: Primal-dual meets local search
cites work: Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
cites work: Chain-Constrained Spanning Trees
cites work: Many birds with one stone
cites work: Approximation algorithms for degree-constrained minimum-cost network-design problems
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Approximating minimum bounded degree spanning trees to within one of optimal
cites work: Q5743495
DOI: 10.1016/J.ORL.2016.09.014
description: scientific article; zbMATH DE number 7002347