Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bouchet. Greedy algorithm and symmetric matroids. Mathematical Programming, 38:147–159, 1987.
A. Bouchet and W. H. Cunningham. Delta-matroids, jump systems and bisubmodular polyhedra. SIAM journal on Discrete Mathematics, 8:17–32, 1995.
R. Chandrasekaran and S. N. Kabadi. Pseudomatroids. Discrete Mathematics, 71(3):205–217, 1988.
A. Recski. Matroid Theory and its Applications in Electric Network Theory and in Statics. Springer-Verlag, 1989.
T. Takabatake. Weakly greedy algorithm, weak-Δ-matroid and its subclasses. Master's thesis, University of Tokyo, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takabatake, T. (1996). Weakly greedy algorithm and pair-delta-matroids. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_84
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive