Skip to main content
SpringerLink
Log in

Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations

Wahrscheinlichkeitstheoretische Analyse kombinatorischer Algorithmen: Bibliographie mit Anmerkungen zu einer Auswahl von Zitaten

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Probabilistic methods in evaluation of performance efficiency of combinatorial optimization algorithms are of continuously growing interest, and rapidly increasing effort of researchers in this field is observed. The present paper is a bibliography which contains 70 references dealing with probabilistic evaluation of time complexity and performance accuracy of deterministic algorithms for combinatorial decision and optimization problems. Some entries of the bibliography, mainly those having appreared in journals and nonperiodical issues of limited distribution are shortly annotated (18 references). Basic notions and definitions facilitating better understanding and plain presentation of different results are given.

Zusammenfassung

Wahrscheinlichkeitstheoretische Methoden zur Bewertung der Effizienz kombinatorischer Optimierungsverfahren finden wachsendes Interesse, und man beobachtet ein rasches Wachstum der Forschungstätigkeit auf diesem Gebiet. Der vorliegende Bericht ist eine Bibliographie über 70 Arbeiten, die sich mit der wahrscheinlichkeitstheoretischen Bewertung der Zeitkomplexität und der Genauigkeit deterministischer Algorithmen für kombinatorische Entscheidungs- und Optimierungsprobleme beschäftigen. Einige Arbeiten, im wesentlichen aus Zeitschriften und unregelmäßig erscheinenden Publikationen mit geringer Auflage, werden kurz diskutiert (18 Zitate). Grundlegende Bezeichnungen und Definitionen, die Verständnis und Darstellung der Ergebnisse erleichtern, sind angegeben.

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

Access this article

Log in via an institution

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. Agrawal, P., Breuer, M. A.: A probabilistic model for the analysis of the routing process for circuits. Networks10, 111–128 (1980).

    Google Scholar 

  2. Angluin, D., Valiant, L. G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Compt. Syst. Sci.19, 155–193 (1979).

    Google Scholar 

  3. Apers, P. M. G.: The expected number of phases of the Dinic-Karzanov network flow algorithm. Informatica Rapport IR 27. Amsterdam: Vrije Universiteit 1978.

    Google Scholar 

  4. d'Atri, G.: Outline of a probabilistic framework for combinatorial optimization. In: Numerical techniques for stochastic systems (Archetti, F., Cugiani, M., eds.), pp. 347–368. North-Holland 1980.

  5. d'Atri, G., Puech, C.: Probabilistic analysis of the subset-sum problem. Report No. 1. Universita della Calabria, 1980.

  6. In the list of references below the asterisk indicates non-English language papers. Bagayev, G. N.: Random graphs of degree two. Diskretnyi Analiz.22, 3–14 (1973).

    Google Scholar 

  7. Beardwood, J., Halton, J. H., Hammersley, J. M.: The shortest path through many points. Proc. Cambridge Philos. Soc.55, 299–328 (1959).

    Google Scholar 

  8. Bloniarz, P.: A shortest path algorithm with expected time 0 (n 2 lognlogIn the list of references below the asterisk indicates non-English language papersn). Proc., 12 ACM Symp. on Theory of Compt., Los Angeles, 1980.

  9. Bollobás, B., Erdös, P.: Cliques in random graphs. Proc. Cambridge Philos. Soc.80, 419–427 (1976).

    Google Scholar 

  10. In the list of references below the asterisk indicates non-English language papers. Borovkov, A. A.: Toward a probabilistic formulation of two problems from economy. Doklady Akad. Nauk SSSR (Matematika)146, 983–986 (1962).

    Google Scholar 

  11. Cornuejols, G., Nemhauser, G. L., Wolsey, L. A.: Worst-case and probabilistic analysis of algorithms for a location problem. Technical Report No. 375. School of OR and IE. Cornel Univ. Ithaca 1978.

  12. Donath, W. E.: Algorithm and average-value bounds for assignment problems. IBM J. Res. Develop.13, 380–386 (1969).

    Google Scholar 

  13. Erdös, P., Rényi, A.: On random graphs I. Publicationes Mathematicae6, 290–297 (1959).

    Google Scholar 

  14. Erdös, P., Rényi, A.: On the evolution of random graphs. Public. Math. Inst. Hung. Acad. Sci.5A, 17–61 (1960).

    Google Scholar 

  15. Erdös, P., Rényi, A.: On random matrices. Public Math. Inst. Hung. Acad. Sci.8 A (1963).

  16. Erdös, P., Rényi, A.: On the existence of a factor of degree one of connected random graphs. Acta Math. Acad. Sc. Hung.17, 359–368 (1966).

    Google Scholar 

  17. Erdös, P., Spencer, J.: Probabilistic methods in combinatorics. New York: Academic Press 1974.

    Google Scholar 

  18. Evans, J. R.: Maximum flow in probabilistic graphs — the discrete case. Networks6 (1976).

  19. Fisher, M. L., Hochbaum, D. S.: Probabilistic analysis of the planar k-median problem. Mathem. Operat. Res.5, 27–34 (1980).

    Google Scholar 

  20. In the list of references below the asterisk indicates non-English language papers. Gabovitch, E. Ya., Melamed, I. I.: An asymptotic exactness for mass h-problems. Trudy Mosk. Inst. Inzh. Zheleznodorozh. Transp.473, 124–135 (1974).

    Google Scholar 

  21. In the list of references below the asterisk indicates non-English language papers Gabovitch, E. Ya., Melamed, I. I.: An approach to the analysis of problems about the length of permutations. Tekhnicheskaya Kibernetika1980, 17–25.

  22. Garfinkel, R. S., Gilbert, K. C.: The bottleneck traveling salesman problem: Algorithms and probabilistic analysis. J. ACM25, 435–448 (1978).

    Google Scholar 

  23. Gimpel, J. F.: A stochastic approach to the solution of large covering problems. IEEE on Switch. Autom. Theory1967, 76–83.

  24. Golden, B. L.: A statistical approach to the TSP. Networks7, 209–225 (1977).

    Google Scholar 

  25. Grimmet, G. R., McDiarmid, C. J. H.: On colouring random graphs. Proc. Cambridge Phil. Soc.77, 314–324 (1975).

    Google Scholar 

  26. In the list of references below the asterisk indicates non-English language papers. Guimady, E. H., Glebov, N. I., Perepelitsa, V. A.: Research in the theory of scheduling. Upravljaemye Sistemy1974, 3–10.

  27. In the list of references below the asterisk indicates non-English language papers. Guimady, E. H., Glebov, N. I., Perepelitsa, V. A.: Algorithms with bounds for discrete optimization problems. Problemy Kibernetiki31, 35–42 (1976).

    Google Scholar 

  28. In the list of references below the asterisk indicates non-English language papers. Guimady, E. H., Perepelitsa, V. A.: A statistically efficient algorithm for finding Hamiltonian circuit (cycle). In: Diskretnyi Analiz1973, 15–28.

  29. In the list of references below the asterisk indicates non-English language papers Guimady, E. H., Perepelitsa, V. A.: On statistically efficient algorithms for some extremal problems from graph theory: In: Tezisy III Vsesouznoi Konferencii po Problemam Tekhnitscheskoy Kibernetiki, pp. 125–127. Novosibirsk: 1974.

  30. In the list of references below the asterisk indicates non-English language papers Guimady, E. H., Perepelitsa, V. A.: An asymptotical approach to solving the traveling salesman problem. In: Upravljaemye Sistemy1974, 35–45.

  31. Karp, R. M.: The fast approximate solution of hard combinatorial problems. Proc. Sixth. Southeastern Conf. Comb., Graph Theory and Compt. Winnipeg: Utilitas Matherm. Publ. 1975.

    Google Scholar 

  32. Karp, R. M.: The probabilistic analysis of some combinatorial search algorithms. In: Algorithms and complexity: New Directions and recent results (Traub, J. P., ed.), pp. 1–19. New York: Academic Press 1976.

    Google Scholar 

  33. Karp, R. M.: Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Mathem. Operat. Res.2, 209–224 (1977).

    Google Scholar 

  34. Karp, R. M.: Recent advances in the probabilistic analysis of graph-theoretical algorithms (Abstract). In: Lecture Notes in Compt. Sixth Colloq. Autom. Lang. and Programming (Mayer, H. A., ed.), pp. 338–339. Berlin-Heidelberg-New York: Springer 1979.

    Google Scholar 

  35. Karp, R. M.: Probabilistic analysis of a canonical numbering algorithm for graphs. Proc. AMS Symposia in Applied Math.34, 365–378 (1979).

    Google Scholar 

  36. Karp, R. M.: A patching algorithm for the nonsymmetric travelling salesman problem. SIAM J. Comp.8, 561–573 (1979).

    Google Scholar 

  37. Klee, V.: Combinatorial optimization: What is the state of the art. Mathem. Operat. Res.5, 1–26 (1980).

    Google Scholar 

  38. Koršunov, A. D.: On the power of some classes of graphs. Soviet Math. Dokl.11, 1100–1104 (1970).

    Google Scholar 

  39. Koršunov, A. D.: Solution of a problem of Erdös and Rényi on Hamiltonian cycles in nonoriented graphs. Soviet Math. Dokl.17, 760–764 (1976).

    Google Scholar 

  40. Lenstra, J. K., Rinnoy Kan, A. H. G.: On the expected performance of branch-and-bound algorithms. Operat. Res.26, 347–349 (1978).

    Google Scholar 

  41. Leuker, G. S.: Maximization problems on graphs with edge weights choosen from a normal distribution. Proc. Tenth Ann. Symp. on Theory of Comp. ACM, New York, pp. 13–18 (1978).

  42. Matula, D. W.: On the complete subgraphs of a random graph. Proc. Second Chapel Hill Conf. on Comb. Math. and Appl., Chapel Hill, pp. 365–369, 1979.

  43. McDiarmid, G.: Colouring random graphs badly. In: Graph theory and combinatorics, pp. 76–78. San Francisco: Pitman 1979.

    Google Scholar 

  44. In the list of references below the asterisk indicates non-English language papers. Morozenskii, L. Yu.: The asymptotic behaviour of the traveling salesman tour length when the cities are randomly distributed. Teoriya Veroyatnostey i Ee Primeneniya19, 828–831 (1974).

    Google Scholar 

  45. In the list of references below the asterisk indicates non-English language papers Morozov, S. A.: On the problem of finding the shortest spanning tree with constraints. Upravljaemye Sistemy15, 40–47 (1976).

    Google Scholar 

  46. In the list of references below the asterisk indicates non-English language papers Nigmatullin, R. G.: On covering a graph by edges. Problemy Kibernetiki21, 241–248 (1969).

    Google Scholar 

  47. Noshita, K., Masuda, E., Machida, H.: On the expected behaviour of the Dijkstra's shortest path algorithm for complete graphs. Inform. Process. Letters7, 237–243 (1978).

    Google Scholar 

  48. O'Neil, P. E.: Asymptotics and random matrices with row-sum and column-sum restrictions. Bull. Amer. Mathem. Soc.75, 1276–1282 (1969).

    Google Scholar 

  49. Palásti, I.: On Hamiltonian-cycles of random graphs. Periodica Math. Hung.1, 107–112 (1971).

    Google Scholar 

  50. In the list of references below the asterisk indicates non-English language papers Perepelitsa, V. A.: On the assignment problem. Upravljaemye Sistemy2, 45–48 (1969).

    Google Scholar 

  51. In the list of references below the asterisk indicates non-English language papers Perepelitsa, V. A.: On two problems from the theory of graphs. Soviet Math. Dokl.11, 1376–1379 (1970).

    Google Scholar 

  52. In the list of references below the asterisk indicates non-English language papers Perepelitsa, V. A.: An asymptotic approach to solving some extremal problems in graphs. Problemy Kibernet.26, 291–314 (1973).

    Google Scholar 

  53. In the list of references below the asterisk indicates non-English language papers Perepelitsa, V. A., Guimady, E. H.: To the problem of finding minimal Hamiltonian circuit in a graph with weighted arcs. Diskretnyi Analiz15, 57–65 (1969).

    Google Scholar 

  54. In the list of references below the asterisk indicates non-English language papers Popescu, M. F.: Implicit enumeration methods based on the piece-wise monotony. In: Proc. 7th Conf. on Probab. Theory and Appl., Brasov, 1979. (In French.)

  55. Posa, L.: Hamiltonian circuits in random graphs. Discrete Math.14, 359–364 (1976).

    Google Scholar 

  56. Rabin, M. O.: Probabilistic algorithms. In: Algorithms and complexity: New directions and recent results (Traub, J. F., ed.), pp. 21–39. New York: Academic Press 1976.

    Google Scholar 

  57. Rohlf, F. J.: A probabilistic minimum spanning tree algorithm. Inform. Proc. Letters7, 44–48 (1978).

    Google Scholar 

  58. In the list of references below the asterisk indicates non-English language papers. Satchkov, V. N.: Veroyatnostnye Metody v Kombinatornom Analize. Moscow: Nauka 1978.

    Google Scholar 

  59. Schnorr, C. P.: An algorithm for transitive closure with linear expected time. SIAM J. on Compt.7, 127–133 (1978).

    Google Scholar 

  60. In the list of references below the asterisk indicates non-English language papers. Serdyukov, A. I.: On the covering and assignment problems. IN: Tezisy Dokl. III Vsesoyuznoy Konf. po Problemam Teoreticheskoy Kibern., Novosibirsk, pp. 94–96, 1974.

  61. In the list of references below the asterisk indicates non-English language papers Sevastyanov, S. V.: On approximate solution of some scheduling problems. Metody Diskretnovo Analiza v Sintese Upravljaustchih Sistem32, 66–75 (1978).

    Google Scholar 

  62. Slominski, L.: On statistically efficient algorithms for combinatorial optimization problems. (An extended Abstract.) In: Proc. Vth Symp. on OR. Cologne, 1980 (to appear).

  63. Stein, D. M.: An asymptotic, probabilistic analysis of a routing problem. Mathem. Operat. Res.3, 89–101 (1978).

    Google Scholar 

  64. Summer, D. P.: Randomly matchable graphs. J. Graph. Theory3, 183–186 (1979).

    Google Scholar 

  65. In the list of references below the asterisk indicates non-English language papers. Tinhofer, G.: Zufallsgraphen. München: C. Hanser Verlag 1980.

    Google Scholar 

  66. Valiant, G. L.: The complexity of combinatorial computations: An introduction. In: GI-8 Jahrestagung (Shindler, S., Giloi, W. K., eds.), pp. 326–337. Berlin-Heidelberg-New York: Springer 1978.

    Google Scholar 

  67. Walkup, D. W.: On the expected value of a random assignment problem. SIAM J. on Compt.8, 440–442 (1979).

    Google Scholar 

  68. Walkup, D. W.: Matchings in random regular bipartite digraphs. Discrete Mathem.31, 59–64 (1980).

    Google Scholar 

  69. Weide, B.: A survey of analysis techniques for discrete algorithms. Computing Surveys9, 291–313 (1977).

    Google Scholar 

  70. Weide, B.: Statistical methods in algorithm design and analysis. Ph.D. Dissertation, Compt. Sci. Dept., Carnegie-Mellon Univ., 1978.

Download references

Author information

Authors and Affiliations

  1. Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, PL-01-447, Warszawa, Poland

    L. Slominski

Authors
  1. L. Slominski
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Preparation of this report was supported in part by DAAD Scholarship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Slominski, L. Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations. Computing 28, 257–267 (1982). https://doi.org/10.1007/BF02241753

Download citation

  • Received:

  • Issue Date:

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

Key words

AMS Subject Classification

Search

Navigation