Author:
Dinitz Michael,Nazari Yasamin,Zhang Zeyu
Publisher
Springer International Publishing
Reference31 articles.
1. Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81–100 (1993)
2. Babay, A., Dinitz, M., Zhang, Z.: Characterizing demand graphs for (fixed-parameter) shallow-light steiner network. arXiv preprint arXiv:1802.10566 (2018)
3. Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. In: Proceedings of the 2011 IEEE 52Nd Annual Symposium on Foundations of Computer Science, pp. 472–481. FOCS 2011 (2011)
4. Berman, P., Bhattacharyya, A., Makarychev, K., Raskhodnikova, S., Yaroslavtsev, G.: Approximation algorithms for spanner problems and directed Steiner forest. Inf. Comput. 222, 93–107 (2013)
5. Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. SIAM J. Comput. 41(6), 1380–1425 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献