PROBABILISTIC ANALYSIS OF ALGORITHMS

An introductory and selective review is presented of results obtained through a probabilistic analysis of combinatorial algorithms. The emphasis is on asymptotic characteristics of optimal solution values, and on the relative and absolute error analysis for simple heuristics.


Issue Date:
1985
Publication Type:
Working or Discussion Paper
DOI and Other Identifiers:
Record Identifier:
https://ageconsearch.umn.edu/record/272328
Language:
English
Total Pages:
30
Series Statement:
REPORT 8538/A




 Record created 2018-04-30, last modified 2020-10-28

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)