From Worst-Case to Average-Case Efficiency – Approximating Combinatorial Optimization Problems

• Main Author: Plociennik, Kai
• Other Authors: TU Chemnitz, Informatik
• Format: Doctoral Thesis
• Language: English
• Published: Universitätsbibliothek Chemnitz 2011
• Subjects: Approximationsalgorithmus; Average-Case Effizienz; Average-Case Analyse; Independent Set; Coloring; Shortest Common Superstring; approximation algorithm; average-case efficiency; average-case analysis; ddc:000; Optimierungsproblem; Average-case-Komplexität
• 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

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 roughly defined as having polynomial expected running time with respect to the random inputs. Depending on the actual notion of efficiency one uses, the approximability of a combinatorial optimization problem can be very different. In this dissertation, the approximability of three classical combinatorial optimization problems, namely Independent Set, Coloring, and Shortest Common Superstring, is investigated for different notions of efficiency. For the three problems, approximation algorithms are given, which guarantee approximation ratios that are unachievable by worst-case efficient algorithms under reasonable complexity-theoretic assumptions. The algorithms achieve polynomial expected running time for different models of random inputs. On the one hand, classical average-case analyses are performed, using totally random input models as the source of random inputs. On the other hand, probabilistic analyses are performed, using semi-random input models inspired by the so called smoothed analysis of algorithms. Finally, the expected performance of well known greedy algorithms for random inputs from the considered models is investigated. Also, the expected behavior of some properties of the random inputs themselves is considered.