Author:
Antoniadis Antonios,Capretto Margarita,Chalermsook Parinya,Damerius Christoph,Kling Peter,Nölke Lukas,Obscura Acosta Nidia,Spoerhase Joachim
Publisher
Springer International Publishing
Reference19 articles.
1. Antoniadis, A., et al.: On minimum generalized Manhattan connections. CoRR abs/2010.14338 (2020). https://arxiv.org/abs/2010.14338
2. Chalermsook, P., Chuzhoy, J., Saranurak, T.: Pinning down the strong Wilber 1 bound for binary search trees. arXiv preprint arXiv:1912.02900 (2019)
3. Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K., Saranurak, T.: Pattern-avoiding access in binary search trees. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 410–423. IEEE (2015)
4. Chekuri, C., Even, G., Gupta, A., Segev, D.: Set connectivity problems in undirected graphs and the directed Steiner network problem. ACM Trans. Algorithms (TALG) 7(2), 1–17 (2011)
5. Chepoi, V., Nouioua, K., Vaxes, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theoret. Comput. Sci. 390(1), 56–69 (2008)