Author:
Bazgan Cristina,Santha Miklos,Tuza Zsolt
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference18 articles.
1. S. Arora, C. Lund, C. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proc. of 33rd FOCS, 1992, 14, 23
2. Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs;Alon,1994
3. Krawczyk's graphs show Thomason's algorithm for finding a second Hamilton cycle through a given edge in a cubic graph is exponential;Cameron,1998
4. Approximating the minimum-degree Steiner tree to within one of optimal;Fürer;J. Algorithms,1994
5. On the Approximability of some Maximum Spanning Tree Problems;Galbiati;Theoret. Comput. Sci.,1997
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献