Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1981: Fundamentals of Computation Theory pp 24–33Cite as

Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems

  • Conference paper
  • First Online:

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

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. B.BOLLOBAS, P.ERDŐS: Cliques in random graphs, Math. Proc. Cambridge Phil. Soc. Vol. 80 (1976).

    Google Scholar 

  2. G.D'ATRI: Probabilistic analysis of the knapsack problem, Techn. Rep. n.7, g.d.r.n. 22 CNRS (1978).

    Google Scholar 

  3. P. ERDŐS, J. SPENCER: Probabilistic methods in combinatories, Academic Press, N.Y. (1974).

    Google Scholar 

  4. M.R. GAREY, D.S. JOHNSON: Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco (1979).

    Google Scholar 

  5. G.R.GRIMMETT, C.J.H.Mc DIARMID: On colouring random graphs, Math. Proc. Cambridge Phil. Soc. Vol. 77 (1975).

    Google Scholar 

  6. R.M. KARP: The probabilistic analysis of some combinatorial searc algorithms; in J.F. Traub (ed.) “Algorithms and Complexity: New directions and recent results”, Academic Press, N.Y. (1976)

    Google Scholar 

  7. D.W.MATULA: The largest clique size in a random graph, Techn. Rep. CS76-03, Southern Metho. Univ. (1976).

    Google Scholar 

  8. R. TERADA: Polynomial time algorithms for NP-hard problems which are optimal or near optimal with probability one, Techn. Rep. 79–351, Dep. Comp. Sc., Wisconsin Univ. (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Automatica, Universita di Roma A. Marchetti-Spaccamela IASI-CNR, Roma

    G. Ausiello

  2. Istituto Matematico, Universita dell'Aquila, Italy

    M. Protasi

Authors
  1. G. Ausiello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Protasi
    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

Ausiello, G., Protasi, M. (1981). Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems. 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_3

Download citation

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

  • 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