Degree bounded matroids and submodular flows
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.
scientific article