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

  • G. Ausiello
  • M. Protasi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    B.BOLLOBAS, P.ERDŐS: Cliques in random graphs, Math. Proc. Cambridge Phil. Soc. Vol. 80 (1976).Google Scholar
  2. [2]
    G.D'ATRI: Probabilistic analysis of the knapsack problem, Techn. Rep. n.7, g.d.r.n. 22 CNRS (1978).Google Scholar
  3. [3]
    P. ERDŐS, J. SPENCER: Probabilistic methods in combinatories, Academic Press, N.Y. (1974).Google Scholar
  4. [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. [5]
    G.R.GRIMMETT, C.J.H.Mc DIARMID: On colouring random graphs, Math. Proc. Cambridge Phil. Soc. Vol. 77 (1975).Google Scholar
  6. [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. [7]
    D.W.MATULA: The largest clique size in a random graph, Techn. Rep. CS76-03, Southern Metho. Univ. (1976).Google Scholar
  8. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • G. Ausiello
    • 1
  • M. Protasi
    • 2
  1. 1.Istituto di AutomaticaUniversita di Roma A. Marchetti-Spaccamela IASI-CNRRoma
  2. 2.Istituto MatematicoUniversita dell'AquilaItaly

Personalised recommendations