Suchergebnisse - "Randomised AND approximation algorithms*"

Parameterised counting complexity theory von Roth, Marc

“… A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity …”
Volltext

Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands von Chaturvedi, Anya, Chekuri, Chandra, Liu, Mengxue, Richa, Andrea W., Rost, Matthias, Schmid, Stefan, Weber, Jamison

“… Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem - the …”
Volltext

On String Matching with Mismatches von Nicolae, Marius, Rajasekaran, Sanguthevar

“… We offer deterministic, randomized and approximation algorithms. We consider variants of these problems where there could …”
Volltext

Data Structures and Algorithms for the Identification of Biological Patterns von Nicolae, Marius

“… This thesis studies the following problems:1. Planted Motif Search. Discovering patterns in biological sequences is a crucial process that has resulted in the …”
Volltext