Hang Zhou

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 30

Top Venues

CoRR

SODA

IACR Cryptol. ePrint Arch.

ICALP

École Normale Supérieure, Paris, France (PHD)

Education History

École Normale Supérieure, Paris, France

PHD

Publications

Ernest van Wijland, Hang Zhou
Faster Approximation Scheme for Euclidean k-TSP. SoCG (2024)
Claire Mathieu, Hang Zhou
Iterated tour partitioning for Euclidean capacitated vehicle routing. Random Struct. Algorithms 62 (4) (2023)
Claire Mathieu, Hang Zhou
A simple algorithm for graph reconstruction. Random Struct. Algorithms 63 (2) (2023)
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. ITCS (2023)
Marc Dufay, Claire Mathieu, Hang Zhou
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. STACS (2023)
Zipei Nie, Hang Zhou
Euclidean Capacitated Vehicle Routing in Random Setting: A 1.55-Approximation Algorithm. CoRR (2023)
Philip N. Klein, Claire Mathieu, Hang Zhou
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. Algorithmica 85 (10) (2023)
Claire Mathieu, Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees. ACM Trans. Algorithms 19 (2) (2023)
Claire Mathieu, Hang Zhou
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. ICALP (2023)
Tobias Mömke, Hang Zhou
Capacitated Vehicle Routing in Graphic Metrics. SOSA (2023)
Tobias Mömke, Hang Zhou
Capacitated Vehicle Routing in Graphic Metrics. CoRR (2022)
Marc Dufay, Claire Mathieu, Hang Zhou
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. CoRR (2022)
Claire Mathieu, Hang Zhou
A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. CoRR (2022)
Claire Mathieu, Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees. ICALP (2022)
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. CoRR (2022)
Claire Mathieu, Hang Zhou
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. ISAAC (2021)
Claire Mathieu, Hang Zhou
A Simple Algorithm for Graph Reconstruction. ESA (2021)
Claire Mathieu, Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees. CoRR (2021)
Claire Mathieu, Hang Zhou
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. CoRR (2021)
Claire Mathieu, Hang Zhou
A Simple Algorithm for Graph Reconstruction. CoRR (2021)
Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Hang Zhou
Backtracking-assisted multiplication. Cryptogr. Commun. 10 (1) (2018)
Sampath Kannan, Claire Mathieu, Hang Zhou
Graph Reconstruction and Verification. ACM Trans. Algorithms 14 (4) (2018)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC (2018)
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
Optimization of Bootstrapping in Circuits. SODA (2017)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA (2017)
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
Optimization of Bootstrapping in Circuits. CoRR (2016)
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou
Optimization of Bootstrapping in Circuits. IACR Cryptol. ePrint Arch. 2016 (2016)
Sampath Kannan, Claire Mathieu, Hang Zhou
Near-Linear Query Complexity for Graph Inference. ICALP (1) (2015)
Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Hang Zhou
Backtracking-Assisted Multiplication. IACR Cryptol. ePrint Arch. 2015 (2015)
Philip N. Klein, Claire Mathieu, Hang Zhou
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs. STACS (2015)
Marc Lelarge, Hang Zhou
Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs. Theor. Comput. Sci. 548 (2014)
Sampath Kannan, Claire Mathieu, Hang Zhou
Graph Verification and Reconstruction via Distance Oracles. CoRR (2014)
Marc Lelarge, Hang Zhou
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs. ISAAC (2013)
Claire Mathieu, Hang Zhou
Graph Reconstruction via Distance Oracles. ICALP (1) (2013)
Claire Mathieu, Hang Zhou
Graph Reconstruction via Distance Oracles CoRR (2013)
Marc Lelarge, Hang Zhou
Constant-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs CoRR (2012)
Walter Bach, Hang Zhou
Approximation for Maximum Surjective Constraint Satisfaction Problems CoRR (2011)

Hang Zhou.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hang Zhou