Sökning: "Approximation Algorithms"
Visar resultat 1 - 5 av 165 avhandlingar innehållade orden Approximation Algorithms.
1. Studies in Efficient Discrete Algorithms
Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER
2. Approximation Algorithms for Geometric Networks
Sammanfattning : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. LÄS MER
3. Exact and approximation algorithms for graph problems with some biological applications
Sammanfattning : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. LÄS MER
4. Some new randomized approximation algorithms
Sammanfattning : .... LÄS MER
5. Constructing Evolutionary Trees - Algorithms and Complexity
Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER