Hang Zhou

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