Author:
Bazgan Cristina,Santha Miklos,Tuza Zsolt
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proc. of 33rd FOGS, pages 14–23, 1992.
2. N. Alon, R. Yuster, U. Zwick, Color-coding: anew method for finding simple paths, cycles and other small subgraphs within large graphs, Proc. of 26th STOC, pages 326–335, 1994.
3. R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. (2) 51 (1950), 161–166.
4. M. Fürer, B. Raghavachari, Approximating the Minimum-Degree Steiner Tree to within One of Optimal, Journal of Algorithms, 17, pages 409–423, 1994.
5. G. Galbiati, A. Morzenti, F. Maffioli, On the Approximability of some Maximum Spanning Tree Problems, to appear in Theoretical Computer Science.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献