Skip to main content
SpringerLink
Log in
Book cover

Optimization Techniques pp 216–224Cite as

Worst-case analysis for a class of combinatorial optimization algorithms

  • Integer Programming, Networks
  • Conference paper
  • First Online:

  • 158 Accesses

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 7))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, J.D. Ullmann, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass. (1974).

    Google Scholar 

  2. Th. Baker, J. Gill, R. Solovay, "Relativizations of the P=? NP question", SIAM Journal on Computing 4 (1975) 431–442.

    Google Scholar 

  3. S.A. Cook, "The complexity of theorem-proving procedures", Proceedings of the Third Annual ACM Symposium on the Theory of Computing, Shaker Heights, Ohio (1971) 151–158.

    Google Scholar 

  4. J. Edmonds, "Matroids and the greedy algorithm", Mathematical Programming 1 (1971) 127–136.

    Google Scholar 

  5. D. Hausmann, B. Korte, "Lower bounds on the worst-case complexity of some oracle algorithms", Working Paper No. 7757-OR, Institut für Ökonometrie und Operations Research, University of Bonn (1977).

    Google Scholar 

  6. D. Hausmann, B. Korte, "Oracle algorithms for fixed-point problems — an axiomatic approach", Working Paper No. 776-OR, Institut für Ökonometrie und Operations Research, University of Bonn (1977), to be published in: R. Henn, B. Korte, W. Oettli (ed.), Operations Research und Optimierung, Springer-Verlag, Berlin, Heidelberg, New York (1978).

    Google Scholar 

  7. B. Korte, D. Hausmann, "An analysis of the greedy heuristic for independence systems", to be published in: Annals of Discrete Mathematics, Vol 2, Proceedings of the Conference on Algorithmic Aspects of Combinatorics, Qualicum Beach, B.C. (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Ökonometrie und Operations Research, Universität Bonn, Germany

    Dirk Hausmann & Bernhard Korte

Authors
  1. Dirk Hausmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Stoer

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Hausmann, D., Korte, B. (1978). Worst-case analysis for a class of combinatorial optimization algorithms. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006526

Download citation

  • DOI: https://doi.org/10.1007/BFb0006526

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08708-3

  • Online ISBN: 978-3-540-35890-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation