Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On the greedy algorithm with random costs

  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider hereditary systems (such as matroids) where the underlying elements have independent random costs, and investigate the cost of the base picked by the greedy algorithm.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.E. Dyer, A.M. Frieze and C.J.H. McDiarmid, “On linear programs with random costs,”Mathematical Programming 35 (1986) 3–16.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Erdös and A. Rényi, “On the evolution of random graphs,”Publications of the Mathematical Institute of the Hungarian Academy of Science 5 (1960) 17–61.

    MATH  Google Scholar 

  3. A.M. Frieze, “On the value of a random minimum spanning tree problem,”Discrete Applied Mathematics 10 (1985) 47–56.

    Article  MATH  MathSciNet  Google Scholar 

  4. R.M. Karp, “An upper bound on the expected cost of an optimal assignment,” Computer Science Division, University of California, Berkeley, 1984.

    Google Scholar 

  5. R.M. Karp, J.K. Lenstra, C.J.H. McDiarmid and A.H.G. Rinnooy Kan, “Probabilistic analysis of combinatorial algorithms: An annotated bibliography,” in: M. O’hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (John Wiley and Sons Ltd., Chichester, 1985).

    Google Scholar 

  6. D.G. Kelly and J.G. Oxley, “Threshold functions for some properties of random subsets of projective spaces,”Oxford Quarterly Journal of Mathematics (2) 33 (1982) 463–469.

    Article  MATH  MathSciNet  Google Scholar 

  7. L.R. Matthews, “Closure in independence systems,”Mathematics of Operations Research 7 (1982) 159–171.

    Article  MATH  MathSciNet  Google Scholar 

  8. C.J.H. McDiarmid, “General first-passage percolation,”Advances in Applied Probability 15 (1983) 149–161.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Narayan and M.N. Vartak, “On molecular and atomic matroids,”Lecture Notes in Mathematics 885 (Springer-Verlag, Berlin-Heidelberg-New York, 1981), pp. 358–364.

    Google Scholar 

  10. D.J.A. Welsh,Matroid Theory (Academic Press, London-New York-San Francisco, 1976).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Economics and Statistics, Oxford, UK

    Colin McDiarmid

Authors
  1. Colin McDiarmid
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

McDiarmid, C. On the greedy algorithm with random costs. Mathematical Programming 36, 245–255 (1986). https://doi.org/10.1007/BF02592060

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation