Keywords
- Greedy Algorithm
- Rank Function
- Point Search
- Chordal Graph
- Basic Word
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
BJÖRNER, A. [1985]: On matroids, groups and exchange languages. in: L. Lovász and A. Recski (eds): Matroid Theory and its Applications. Conference Proceedings, Szeged, September 1982. Colloquia Mathematica Societatis Janós Bolyai, Vol. 40, North Holland, Amsterdam, Oxford, New York, 1985, pp. 25–40.
BJÖRNER, A., KORTE, B. and LOVÁSZ, L. [1985]: Homotopy properties of greedoids. Advances in Applied Mathematics 6 (1985), pp. 447–494.
BLAND, R.G. [1977]: A combinatorial abstraction of linear programming. J. Comb. Th. Series B 23 (1977), pp. 33–57.
BRYLAWSKI, Th.H. [1986]: Greedy families of linear objective functions. Preprint, Dept. of Mathematics, University of North Carolina 1986.
BRYLAWSKI, Th.H. and DIETER, E. [1986]: Exchange systems. Preprint, Dept. of Mathematics, University of North Carolina, Chapel Hill, USA.
CRAPO, H. [1982]: Selectors. A theory of formal languages, semimodular lattices and shelling processes. Advances in Mathematics 54 (1984), pp. 233–277.
DIETRICH, B. [1985] Lecture at the III. International Conference on Combinatorial Mathematics, New York Academy of Sciences.
DUFFUS, D. and RIVAL, I. [1976]: Crown on dismantable partially ordered sets. in: Colloquia Mathematica Societatis Janós Bolyai, 18. Combinatorics. Keszthely, 1976, pp. 271–292.
EDELMAN, P.H. [1980]: Meet-distributive lattices and anti-exchange closure. Algebra Universalis 10, 1980, pp. 290–299.
EDELMAN, P.H. and JAMISON, R.E. [1985]: The theory of convex geometries. Geometriae dedicata 19, 1985, pp. 247–270.
EDMONDS, J. [1965]: Paths, trees and flowers. Canadian Journal of Mathematics 17 (1965), pp. 449–467.
EDMONDS, J. [1970]: Submodular functions, matroids and certain polyhedra. in: R. Guy, H. Hanani, N. Sauer, J. Schonheim (eds.): Combinatorial Structures and their Applications. Gardon and Breach (1970), pp. 69–87.
EDMONDS, J. [1971]: Matroids and the greedy algorithm. Math. Programming 1 (1971), pp. 127–136.
EDMONDS, J. and FULKERSON, D.R. [1970]: Bottleneck extrema. J. Comb. Th. 8 (1970), pp. 299–306.
ERDÖS, P. and GRAHAM, R.L. [1980]: Old and new problems in combinatorial number theory. Monographie No 28 de L'Enseignement Mathématic, Université de Genéve, Genéve 1980.
FAIGLE, U. [1979]: The greedy algorithm for partially ordered sets. Discrete Mathematics 28 (1979), pp. 153–159.
FAIGLE, U. [1980]: Geometries on partially ordered sets. J. Comb. Theory, Series B, 28 (1980), pp. 26–51.
FAIGLE, U. [1985]: Submodular combinatorial structures. Habilitationsschrift Universität Bonn 1985.
FAIGLE, U., GOECKE, O. and SCHRADER, R. [1986]: Church-Rosser decomposition in combinatorial structures. Preprint, Institut für Operations Research, Universität Bonn.
GOECKE, O. [1986a]: A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids. Preprint, Institut für Operations Research, Universität Bonn 1986; to appear in: Discrete Applied Mathematics.
GOECKE, O. [1986b]: Eliminationsprozesse in der kombinatorischen Optimierung — ein Beitrag zur Greedoid-Theorie. Dissertation, Universität Bonn.
GOECKE, O. and SCHRADER, R. [1986]: Minor characterization of undirected branching greedoids — a short proof. Preprint, Institut für Operations Research, Universität Bonn.
GOLUMBIC, M.C. [1980]: Algorithmic Graph Theory and Perfect Graphs. New York, London, San Francisco: Academic Press (1980).
HIGGS, D.D. [1968]: Strong maps of geometries. J. Comb. Th. 5 (1968), pp. 185–191.
JAMISON, R.E. [1982]: A perspective on abstract convexity: Classifying alignments by varieties. in: D.C. Kay and M. Breen (eds.): Convexity and related combinatorial geometry. New York: Marcel Dekker 1982), pp. 113–150.
KORTE, B. and LOVÁSZ, L. [1981]: Mathematical structures underlying greedy algorithms. in: F. Gécseg (ed.): Fundamentals of Computation Theory. Lecture Notes in Computer Science 117. Berlin/Heidelberg/New York: Springer (1981), pp. 205–209.
KORTE, B. and LOVÁSZ, L. [1983]: Structural properties of greedoids.: Combinatorica 3 (1983), pp. 359–374.
KORTE, B. and LOVÁSZ, L. [1984a]: Greedoids, a structural framework for the greedy algorithm. in: W.R. Pulleyblank (ed.): Progress in Combinatorial Optimization. Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, June 1982, pp. 221–243. Academic Press, London/New York/San Francisco 1984.
KORTE, B. and LOVÁSZ, L. [1984b]: Shelling structures, convexity and a happy end. in: B. Bolobás (ed.): Graph Theory and Combinatorics, Proceedings of the Cambridge Combinatiorial Conference in Honour of Paul Erdös, Academic Press, London, 1984, pp. 219–232.
KORTE, B. and LOVÁSZ, L. [1984c]: Greedoids and linear objective functions. SIAM Journ. Algebr. Discr. Methods 5 (1984), pp. 229–238.
KORTE, B. and LOVÁSZ. L. [1985a]: A note on selectors and greedoids.: European Journal of Combinatorics 6 (1985), 59–67.
KORTE, B. and LOVÁSZ, L. [1985b]: Posets, matroids and greedoids. in: L. Lovász and A. Recski (eds.): Matroid Theory and its Applications. Conference Proceedings, Szeged, September 1982. Colloquia Mathematica Societatis Janós Bolyai, Vol. 40, North-Holland, Amsterdam, Oxford, New York, 1985, pp. 239–265.
KORTE, B. and LOVÁSZ, L. [1985c]: Polymatroid greedoids.: Journal of Combinatorial Theory B, 38 (1985), pp. 41–72.
KORTE, B. and LOVÁSZ, L. [1985d]: Relations between subclasses of greedoids. Zeitschrift für Operations Research, Series A 29 (1985), pp. 249–267).
KORTE, B. and LOVÁSZ, L. [1985e]: Basis graphs of greedoids and two-connectivity. in: R.W. Cottle (ed.): Essays in Honor of George B. Dantzig, Part I. Mathematical Programming Study No. 24, North-Holland, Amsterdam 1985, pp. 158–165.
KORTE, B. and LOVÁSZ, L. [1985f]: Polyhedral results for antimatroids. Preprint, Institut für Operations Research, Universität Bonn, to appear in: Annals of the New York Academy of Sciences. Proceedings of the Third International Conference on Combinatorial Mathematics.
KORTE, B. and LOVÁSZ, L. [1985g]: Intersections of matroids and antimatroids. Preprint, Institut für Operations Research, Universität Bonn. to appear in: Discrete Mathematics.
KORTE, B. and LOVÁSZ, L. [1986a]: Homomorphisms and Ramsey properties of antimatroids. Discrete Applied Mathematics 15 (1986), pp. 283–290.
KORTE, B. and LOVÁSZ, L. [1986b]: Non-interval greedoids and the transposition property. Discr. Math. 59 (1986), pp. 297–314.
LAWLER, E.L. [1973]: Optimal sequencing of a single machine subject to precedence contraints. Management Science 19 (1973), pp. 544–546.
LOVÁSZ, L. and PLUMMER, M.D. [1986]: Matching Theory. Akademiai Kiadó, Budapest 1986.
SCHMIDT, W. [1985a]: A characterization of undirected branching greedoids. Institut für Operations Research, Universität Bonn, to appear in: J. Comb. Th..
SCHMIDT, W. [1985b]: Greedoids and searches in directed graphs. Preprint, Institut für Operations Research, Universität Bonn.
SCHMIDT, W. [1985c]: A min-max theorem for greedoids. Preprint, Institut für Operations Research, Universität Bonn.
SCHRADER, R. [1986]: Structural Theory of Discrete Greedy Procedures. Habilitationsschrift Universität Bonn, 1986.
SEYMOUR, P. [1985]: private communication.
WELSH, D.J.A. [1976]: Matroid theory. London, New York, San Francisco: Academic press (1976).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag
About this paper
Cite this paper
Goecke, O., Korte, B., Lovász, L. (1989). Examples and algorithmic properties of greedoids. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083463
Download citation
DOI: https://doi.org/10.1007/BFb0083463
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51797-9
Online ISBN: 978-3-540-46810-3
eBook Packages: Springer Book Archive
