Follow
Hang Zhou
Hang Zhou
Verified email at lix.polytechnique.fr - Homepage
Title
Cited by
Cited by
Year
A (5/3+ ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
302018
Correlation clustering and two-edge-connected augmentation for planar graphs
PN Klein, C Mathieu, H Zhou
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
302015
Optimization of bootstrapping in circuits
F Benhamouda, T Lepoint, C Mathieu, H Zhou
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
242017
Graph reconstruction and verification
S Kannan, C Mathieu, H Zhou
ACM Transactions on Algorithms (TALG) 14 (4), 1-30, 2018
232018
To augment or not to augment: Solving unsplittable flow on a path by creating slack
F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
232017
Graph reconstruction via distance oracles
C Mathieu, H Zhou
International Colloquium on Automata, Languages, and Programming, 733-744, 2013
172013
A PTAS for capacitated vehicle routing on trees
C Mathieu, H Zhou
ACM Transactions on Algorithms 19 (2), 1-28, 2023
132023
Near-linear query complexity for graph inference
S Kannan, C Mathieu, H Zhou
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
122015
A simple algorithm for graph reconstruction
C Mathieu, H Zhou
Random Structures & Algorithms 63 (2), 512-532, 2023
92023
Unsplittable Euclidean Capacitated Vehicle Routing: A -Approximation Algorithm
F Grandoni, C Mathieu, H Zhou
arXiv preprint arXiv:2209.05520, 2022
72022
Capacitated vehicle routing in graphic metrics
T Mömke, H Zhou
Symposium on Simplicity in Algorithms (SOSA), 114-123, 2023
62023
Approximation for maximum surjective constraint satisfaction problems
W Bach, H Zhou
arXiv preprint arXiv:1110.2953, 2011
52011
A tight -approximation for unsplittable capacitated vehicle routing on trees
C Mathieu, H Zhou
Mathematical Programming, 1-32, 2024
42024
Probabilistic analysis of Euclidean capacitated vehicle routing
C Mathieu, H Zhou
arXiv preprint arXiv:2109.06958, 2021
42021
A Tight -Approximation for Unsplittable Capacitated Vehicle Routing on Trees
C Mathieu, H Zhou
arXiv preprint arXiv:2202.05691, 2022
32022
Backtracking-assisted multiplication
H Ferradi, R Géraud, D Maimuţ, D Naccache, H Zhou
Cryptography and Communications 10, 17-26, 2018
32018
Sublinear-time algorithms for monomer–dimer systems on bounded degree graphs
M Lelarge, H Zhou
Theoretical Computer Science 548, 68-78, 2014
32014
A (5/3+∈)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes
F Grandoni, TMA Wiese, H Zhou
Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC …, 0
3
Euclidean Capacitated Vehicle Routing in Random Setting: A -Approximation Algorithm
Z Nie, H Zhou
arXiv preprint arXiv:2304.11281, 2023
22023
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees
M Dufay, C Mathieu, H Zhou
arXiv preprint arXiv:2210.03811, 2022
22022
The system can't perform the operation now. Try again later.
Articles 1–20