* [HBK+03] E. Halperin, J. Buhler, R. M. Karp, R. Krauthgamer, and B. Westover.  Detecting protein sequence conservation via metric embeddings.  Bioinformatics, 19(suppl 1):i122–i129,  07 2003, arXiv:https://academic.oup.com/bioinformatics/article-pdf/19/suppl\\_1/i122/614436/btg1016.pdf, doi:10.1093/bioinformatics/btg1016.
  * [Her22] D. E. Hershkowitz.  private communication,  January 2022.
  * [HHZ21a] B. Haeupler, D. E. Hershkowitz, and G. Zuzic.  Deterministic tree embeddings with copies for algorithms against adaptive adversaries.  CoRR, abs/2102.05168,  2021, arXiv:2102.05168.
  * [HHZ21b] B. Haeupler, D. E. Hershkowitz, and G. Zuzic.  Tree embeddings for hop-constrained network design.  In STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 356–369,  2021, doi:10.1145/3406325.3451053.
  * [HIS13] S. Har-Peled, P. Indyk, and A. Sidiropoulos.  Euclidean spanners in high dimensions.  In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 804–809,  2013, doi:10.1137/1.9781611973105.57.
  * [HKS09] M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour.  Approximating buy-at-bulk and shallow-light _k_ -steiner trees.  Algorithmica, 53(1):89–103, 2009.  preliminary version published in APPROX-RANDOM 2006, doi:10.1007/s00453-007-9013-x.
  * [KKM+12] M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar.  Efficient distributed approximation algorithms via probabilistic tree embeddings.  Distributed Comput., 25(3):189–205, 2012.  preliminary version published in PODC 2008, doi:10.1007/s00446-012-0157-9.
  * [KLS05] J. Könemann, A. Levin, and A. Sinha.  Approximating the degree-bounded minimum diameter spanning tree problem.  Algorithmica, 41(2):117–129, 2005.  preliminary version published in RANDOM-APPROX 2003, doi:10.1007/s00453-004-1121-2.
  * [KP97] G. Kortsarz and D. Peleg.  Approximating shallow-light trees (extended abstract).  In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA, pages 103–110, 1997.  see here.
  * [KP09] E. Kantor and D. Peleg.  Approximate hierarchical facility location and applications to the bounded depth steiner tree and range assignment problems.  J. Discrete Algorithms, 7(3):341–362,  2009, doi:10.1016/j.jda.2008.11.006.
  * [KS16] M. R. Khani and M. R. Salavatipour.  Improved approximations for buy-at-bulk and shallow-light k-steiner trees and (k, 2)-subgraph.  J. Comb. Optim., 31(2):669–685, 2016.  preliminary version published in ISAAC 2011, doi:10.1007/s10878-014-9774-5.
  * [LCM99] L. J. LeBlanc, J. Chifflet, and P. Mahey.  Packet routing in telecommunication networks with path and flow restrictions.  INFORMS J. Comput., 11(2):188–197,  1999, doi:10.1287/ijoc.11.2.188.
  * [Lei16] M. Leitner.  Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem.  Comput. Oper. Res., 65:1–18,  2016, doi:10.1016/j.cor.2015.06.012.
  * [LLR95] N. Linial, E. London, and Y. Rabinovich.  The geometry of graphs and some of its algorithmic applications.  Comb., 15(2):215–245, 1995.  preliminary version published in FOCS 1994, doi:10.1007/BF01200757.
  * [Mat96] J. Matoušek.  On the distortion required for embedding finite metric spaces into normed spaces.  Israel Journal of Mathematics, 93(1):333–344,  1996, doi:10.1007/BF02761110.
  * [MN07] M. Mendel and A. Naor.  Ramsey partitions and proximity data structures.  Journal of the European Mathematical Society, 9(2):253–275, 2007\.  preliminary version published in FOCS 2006, doi:10.4171/JEMS/79.
  * [MRS+98] M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. H. III.  Bicriteria network design problems.  J. Algorithms, 28(1):142–171, 1998.  preliminary version published in ICALP 1995, doi:10.1006/jagm.1998.0930.
  * [NPS11] J. Naor, D. Panigrahi, and M. Singh.  Online node-weighted steiner tree and related problems.  In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 210–219,  2011, doi:10.1109/FOCS.2011.65.
  * [NT12] A. Naor and T. Tao.  Scale-oblivious metric fragmentation and the nonlinear dvoretzky theorem.  Israel Journal of Mathematics, 192(1):489–504,  2012, doi:10.1007/s11856-012-0039-7.
  * [Pel00] D. Peleg.  Proximity-preserving labeling schemes.  J. Graph Theory, 33(3):167–176, 2000.  preliminary version published in WG 1999, doi:10.1002/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5.
  * [PS03] H. Pirkul and S. Soni.  New formulations and solution procedures for the hop constrained network design problem.  Eur. J. Oper. Res., 148(1):126–140,  2003, doi:10.1016/S0377-2217(02)00366-1.
  * [PU89] D. Peleg and E. Upfal.  A trade-off between space and efficiency for routing tables.  J. ACM, 36(3):510–530,  1989, doi:10.1145/65950.65953.
  * [RAJ12] A. Rossi, A. Aubry, and M. Jacomino.  Connectivity-and-hop-constrained design of electricity distribution networks.  Eur. J. Oper. Res., 218(1):48–57,  2012, doi:10.1016/j.ejor.2011.10.006.
  * [Rav94] R. Ravi.  Rapid rumor ramification: Approximating the minimum broadcast time (extended abstract).  In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 202–213,  1994, doi:10.1109/SFCS.1994.365693.
  * [RTZ05] L. Roditty, M. Thorup, and U. Zwick.  Deterministic constructions of approximate distance oracles and spanners.  In Proceedings of the 32Nd International Conference on Automata, Languages and Programming, ICALP’05, pages 261–272, Berlin, Heidelberg, 2005\.  Springer-Verlag, doi:10.1007/11523468_22.
  * [Sol13] S. Solomon.  Sparse euclidean spanners with tiny diameter.  ACM Trans. Algorithms, 9(3):28:1–28:33, 2013.  preliminary version published in SODA 2011, doi:10.1145/2483699.2483708.
  * [TCG15] B. Thiongane, J. Cordeau, and B. Gendron.  Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem.  Comput. Oper. Res., 53:1–8,  2015, doi:10.1016/j.cor.2014.07.013.
  * [TZ01] M. Thorup and U. Zwick.  Compact routing schemes.  In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pages 1–10,  2001, doi:10.1145/378580.378581.
  * [TZ05] M. Thorup and U. Zwick.  Approximate distance oracles.  J. ACM, 52(1):1–24,  2005, doi:10.1145/1044731.1044732.
  * [Voß99] S. Voß.  The steiner tree problem with hop constraints.  Ann. Oper. Res., 86:321–345,  1999, doi:10.1023/A\%3A1018967121276.
  * [WA88] K. A. Woolston and S. L. Albin.  The design of centralized networks with reliability and availability constraints.  Comput. Oper. Res., 15(3):207–217,  1988, doi:10.1016/0305-0548(88)90033-0.
  * [Wul13] C. Wulff-Nilsen.  Approximate distance oracles with improved query time.  In S. Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 539–549. SIAM,  2013, doi:10.1137/1.9781611973105.39.