Advertising Console

    [Lecture 6:1/3] Using Randomness in Computer Science

    Repost
    Nicolas Schabanel

    par Nicolas Schabanel

    26
    60 vues
    Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanel
    Feb 2, 2011 - 16:15-19:15 - Exhaustive Sampling
    • A constant time (1+ε)-approximation for the size of a maximal matching in constant maximum degree graphs
    • Exhaustive guessing 1: a polynomial time randomized (1+ε)-approximation (PTRAS) for Max-CUT in dense graphs