Author:
Richter Silvia,Helmert Malte,Gretton Charles
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)
2. Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Computers and Operations Research 33(12), 3520–3534 (2006)
3. Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica 45, 269–284 (2006)
4. Lecture Notes in Computer Science;I.K. Evans,1998
5. Lecture Notes in Computer Science;S. Gilmour,2006
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献