Abstract
Symmetric matroids are set systems which are obtained, in some sense, by a weakening of the structure of a matroid. These set systems are characterized by a greedy algorithm and they are suitable for dealing with autodual properties of matroids. Applications are given to the eulerian tours of 4-regular graphs and the theory ofg-matroids.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Bouchet, “Isotropic systems,” to appear inEuropean Journal of Combinatorics.
A. Bouchet, “Graphic presentations of isotropic systems,” submitted.
D. Gale, “Optimal assignments in an ordered set: an application of matroid theory,”Journal of Combinatorial Theory 4 (1968) 176–180.
B. Korte and D. Hausmann, “An analysis of the greedy heuristic for independence systems,”Annals of Discrete Mathematics 2 (1978) 65–74.
B. Korte and L. Lovàsz, “Greedoids, a structural framework for the greedy algorithm,” in “Progress in Combinatorial Optimization” in: W.R. Pulleyblank, ed., Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, June 1982, (Academic Press, London/New York/San Francisco, 1984) pp. 221–243.
A. Kotzig, “Eulerian lines in finite 4-valent graphs and their transformations,” in: Erdòs and Katona, eds,Theory of Graphs., Proceedings of the Colloquium held at Tihany (Hungary), Sept. 1966 (North-Holland, Amsterdam, 1968) pp. 219–230.
A. Schultze, personal communication, Oct. 1985.
E. Tardòs, “Generalized matroids,” to appear.
D.J.A. Welsh,Matroid Theory (Academic Press, London, 1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bouchet, A. Greedy algorithm and symmetric matroids. Mathematical Programming 38, 147–159 (1987). https://doi.org/10.1007/BF02604639
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02604639