共 50 条
- [1] Lower bounds for additive spanners, emulators, and more [J]. 47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 389 - 398
- [2] A Hierarchy of Lower Bounds for Sublinear Additive Spanners [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 568 - 576
- [3] A HIERARCHY OF LOWER BOUNDS FOR SUBLINEAR ADDITIVE SPANNERS [J]. SIAM JOURNAL ON COMPUTING, 2018, 47 (06) : 2203 - 2236
- [5] Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 534 - 553
- [7] Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets [J]. 2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 766 - 777
- [8] Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners [J]. Discrete & Computational Geometry, 2010, 43 : 736 - 783