Author:
G. Downey Rodney,Estivill-Castro Vladimir,Fellows Michael,Prieto Elena,Rosamund Frances A.
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 2–12.
2. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proc.38th Annual IEEE Symposium on the Foundations of Computing(FOCS'97), IEEE Press 1997, 554–563.
3. The parameterized complexity of short computation and factorization;Liming;Archive for Mathematical Logic,1997
4. Liming Cai, M. Fellows, D. Juedes and F. Rosamond. Efficient polynomial-time approximation schemes for problems on planar structures: upper and lower bounds. Manuscript, 2001.
5. Liming Cai and D. Juedes. Subexponential parameterized algorithms collapse the W-hierarchy Proceeding of ICALP 2001, Crete, Greece, Springer-Verlag LNCS 2076 2001.
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献