Minimum weight \((T,d)\)-joins and multi-joins
A \((T,d)\)-joint in a graph \(G=(X,E)\) is a set \(T\) of vertices together with a set \(B\) of edges, such that \(B\) is representable as a union of pairwise edge-disjoint \(T\)-paths and circuits with a certain additional property. The paper gives a description for the dominant of the set of \((T,d)\)-joins.
scientific article; zbMATH DE number 1135958