14:00 to 14:45
Symposium
Not recorded

A (5/3+ε)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes

Hang Zhou
Approximation Algorithms and Networks
14:00 to 14:45
    Amphithéâtre Maurice Halbwachs, Site Marcelin Berthelot
    Open to all, subject to availability
    -

    Documents and media

    Speaker(s)

    Hang Zhou

    École polytechnique

    Events

    Symposium
    09:15 to 10:00
    Vincent Cohen-Addad

    Fast Fencing

    Not recorded
    Symposium
    10:00 to 10:45
    Adi Rosén

    Streaming Algorithms for the Set Cover Problem

    Not recorded
    Symposium
    10:45 to 11:30
    Barna Saha

    Space and Time Efficient Algorithms for Lipschitz Problems

    Not recorded
    Symposium
    14:00 to 14:45
    Hang Zhou

    A (5/3+ε)-Approximation for Unsplittable Flow on a Path: Placing Small…

    Not recorded
    Symposium
    14:45 to 15:30
    Victor Verdugo

    Strong Algorithms for the Ordinal Matroid Secretary Problem…

    Not recorded
    Symposium
    15:30 to 16:15
    Anna Ben-Hamou

    Estimating Graph Parameters with Random Walks

    Not recorded
    Symposium
    16:15 to 17:00
    Matthieu Latapy

    Stream Graphs, Link Streams, and Related Algorithmic Challenges…

    Not recorded
    Symposium
    17:00 to 17:45
    Claire Mathieu

    Hierarchical Clustering: Objective Functions and Algorithms…

    Not recorded

    See also

    Claire Mathieu, chair Computer Sciences and Digital Technologies
    Approximation Algorithms and Networks