Search Results - "randomized and approximation algorithms"

  • Showing 1 - 4 results of 4
Refine Results
  1. 1

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

    ISSN: 1063-6692, 1558-2566
    Published: New York IEEE 01.04.2024
    Published in IEEE/ACM transactions on networking (01.04.2024)
    “…Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem - the…”
    Get full text
    Journal Article
  2. 2

    Parameterised counting complexity theory by Roth, Marc

    ISSN: 1574-0137
    Published: Elsevier Inc 01.02.2026
    Published in Computer science review (01.02.2026)
    “…A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 1999-4893, 1999-4893
    Published: Basel MDPI AG 01.06.2015
    Published in Algorithms (01.06.2015)
    “… We offer deterministic, randomized and approximation algorithms. We consider variants of these problems where there could…”
    Get full text
    Journal Article
  4. 4

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

    ISBN: 9798382874340
    Published: ProQuest Dissertations & Theses 01.01.2016
    “…This thesis studies the following problems:1. Planted Motif Search. Discovering patterns in biological sequences is a crucial process that has resulted in the…”
    Get full text
    Dissertation