Author:
Wirth Hans-Christoph,Steffan Jan
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. The minimum labeling spanning trees;Chang;Inform. Process. Lett.,1997
2. U. Feige, A threshold of ln n for approximating set cover, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC’96), 1996, pp. 314–318.
3. M.R. Garey, D.S. Johnson, Computers and Intractability (A guide to the theory of NP-completeness), W.H. Freeman, New York, 1979.
4. On the minimum diameter spanning tree problem;Hassin;Inform. Process. Lett.,1995
5. An algorithmic approach to network location problems, part I: The p-center;Kariv;SIAM J. Appl. Math.,1979
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献