Degree bounded matroids and submodular flows
type: Item
instance of: scholarly article
title: Degree bounded matroids and submodular flows
zbMATH Open document ID: 1299.90432
author: Tamás Király
author: Lap Chi Lau
author: Mohit Singh
published in: Combinatorica
publication date: 2014-05-05T00:00:00Z
full work available at URL: kiraly lau singh final.pdf
review text: The complexity of several rather restricted tasks is elaborated in interdependency of: minimum bounded degree matroid basis, minimum bounded degree submodular flow, minimum bounded degree spanning tree, minimum crossing spanning tree, minimum bounded-ones binary matroid basis, minimum bounded degree graph orientation, etc. There are many proofs in verbal form over 5 or 6 lines. In addition, one will find three long proofs in verbose form. All this is obviously relevant to those who are highly specialized in the field.
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6292171
zbMATH Keywords: complexity
zbMATH Keywords: bounded degree problems
MaRDI profile type: Publication
OpenAlex ID: W2109095726
cites work: On generalizations of network design problems with degree bounds
cites work: Additive Guarantees for Degree-Bounded Directed Network Design
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
cites work: Testing membership in matroid polyhedra
cites work: Q4149476
cites work: An Algorithm for Submodular Functions on Graphs
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Degree Bounded Forest Covering
cites work: Survivable network design with degree or order constraints
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Approximating minimum bounded degree spanning trees to within one of optimal
DOI: 10.1007/S00493-012-2760-6
description: scientific article