From Worst-Case to Average-Case Efficiency – Approximating Combinatorial Optimization Problems
In theoretical computer science, various notions of efficiency are used for algorithms. The most commonly used notion is worst-case efficiency, which is defined by requiring polynomial worst-case running time. Another commonly used notion is average-case efficiency for random inputs, which is roughl...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Universitätsbibliothek Chemnitz
2011
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-65314 http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-65314 http://www.qucosa.de/fileadmin/data/qucosa/documents/6531/diss.pdf http://www.qucosa.de/fileadmin/data/qucosa/documents/6531/signatur.txt.asc |