Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference83 articles.
1. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
2. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M. Complexity and Approximation ? Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999.
3. Motwani R, Raghavan P. Randomized Algorithms. Cambridge University Press, New York, 1995.
4. Michalewicz Z, Fogel D B. How to Solve It: Modern Heuristics. Springer, Berlin, 2000.
5. Roth-Korostensky C. Algorithms for Building Multiple Sequence Alignments and Evolutionary Trees [Dissertation]. No. 13550, ETH Zürich, 2000.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献