Weakly greedy algorithm and pair-delta-matroids
Weakly greedy algorithm is an extension of the greedy algorithm. It gives a solution of a combinatorial optimization problem on discrete systems in a properly wider class than the class of Δ-matroids. Discrete systems with a certain 2 to 2 exchangeability belong to this class. We characterize these systems in terms of their rank function. Excluded minors of Δ-matroids and these systems are also described.
Unable to display preview. Download preview PDF.
- 1.A. Bouchet. Greedy algorithm and symmetric matroids. Mathematical Programming, 38:147–159, 1987.Google Scholar
- 4.A. Recski. Matroid Theory and its Applications in Electric Network Theory and in Statics. Springer-Verlag, 1989.Google Scholar
- 5.T. Takabatake. Weakly greedy algorithm, weak-Δ-matroid and its subclasses. Master's thesis, University of Tokyo, 1995.Google Scholar