2:00 - 2:45pm
Symposium
Not recorded

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

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

    Documents and media

    Speaker(s)

    Hang Zhou

    École polytechnique

    Events

    Fast Fencing
    Vincent Cohen-Addad

    Symposium
    9:15 - 10:00am
    Not recorded

    Streaming Algorithms for the Set Cover Problem
    Adi Rosén

    Symposium
    10:00 - 10:45am
    Not recorded

    Space and Time Efficient Algorithms for Lipschitz Problems
    Barna Saha

    Symposium
    10:45 - 11:30am
    Not recorded

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

    Symposium
    2:00 - 2:45pm
    Not recorded

    Strong Algorithms for the Ordinal Matroid Secretary Problem…
    Victor Verdugo

    Symposium
    2:45 - 3:30pm
    Not recorded

    Estimating Graph Parameters with Random Walks
    Anna Ben-Hamou

    Symposium
    3:30 - 4:15pm
    Not recorded

    Stream Graphs, Link Streams, and Related Algorithmic Challenges…
    Matthieu Latapy

    Symposium
    4:15 - 5:00pm
    Not recorded

    Hierarchical Clustering: Objective Functions and Algorithms…
    Claire Mathieu

    Symposium
    5:00 - 5:45pm
    Not recorded

    See also

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