Skip to main content
SpringerLink
Log in

Mathematical structures underlying greedy algorithms

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 117))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • E.W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269–271.

    Google Scholar 

  • J. Edmonds, Submodular functions, matroids, and certain polyhedra, in: Combinatorial Structures and their Applications, Gordon and Breach, 1970.

    Google Scholar 

  • J. Edmonds, Optimum brauchings, J. Res. Nat. Bur. Stand. B71 (1967) 233–240.

    Google Scholar 

  • E. Lawler, Optimal sequencing of a single machine subject to precendence constraints, Management Sci. 19 (1973) 544–546.

    Google Scholar 

  • D. Welsh, Matroid Theory, Academic Press, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. f. Ökonometrie und Operations Research, Universitat Bonn, D-5300, Bonn, GFR

    B. Korte

  2. Bolyai Institute, József Attila University, H-6720, Szeged, Hungary

    L. Lovász

Authors
  1. B. Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Lovász
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korte, B., Lovász, L. (1981). Mathematical structures underlying greedy algorithms. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation