Author:
Dragan Feodor F.,Köhler Ekkehard
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Abraham, I., Bartal, Y., Neiman, O.: Nearly Tight Low Stretch Spanning Trees. In: FOCS, pp. 781–790 (2008)
2. Alon, N., Karp, R.M., Peleg, D., West, D.B.: A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. 24, 78–100 (1995)
3. Bǎdoiu, M., Indyk, P., Sidiropoulos, A.: Approximation algorithms for embedding general metrics into trees. In: SODA 2007, pp. 512–521. SIAM, Philadelphia (2007)
4. Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)
5. Brandstädt, A., Dragan, F.F., Le, H.-O., Le Tree Spanners, V.B.: on Chordal Graphs: Complexity and Algorithms. Theoret. Comp. Science 310, 329–354 (2004)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献