Author:
Dragan Feodor F.,Köhler Ekkehard
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference43 articles.
1. Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), Philadelphia, PA, USA, 25–28 October 2008, pp. 781–790. IEEE Comput. Soc., Los Alamitos (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. Ausiello, G., D’Arti, A., Moscarini, M.: Chordality properties on graphs and minimal conceptual connections in semantic data models. J. Comput. Syst. Sci. 33, 179–202 (1986)
4. Lecture Notes in Computer Science;M. Bǎdoiu,2008
5. Bǎdoiu, M., Indyk, P., Sidiropoulos, A.: Approximation algorithms for embedding general metrics into trees. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, 7–9 January 2007, pp. 512–521. SIAM, Philadelphia (2007)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献