Randomised techniques in combinatorial algorithmics

0044 English OPEN
Zito, M.;
  • Publisher: Department of Computer Science
  • Subject: QA76

Probabilistic techniques are becoming more and more important in Computer Science. Some of them are useful for the analysis of algorithms. The aim of this thesis is to describe and develop applications of these techniques. We first look at the problem of generating a gr... View more
  • References (2)

    134 2k))2).

    [ADJS93] I. Althofer, G. Das, D. Joseph, and J. Soares. On Sparse Spanners of Weighted Graphs. Discrete and Computational Geometry, 9:81-100, 1993.

  • Metrics
Share - Bookmark