Author:
Johnson David S.,Papadimitriou Christos H.,Yannakakis Mihalis
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference12 articles.
1. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
2. The monotone and planar circuit value problems are log space complete for P;Goldschlager;SIGACT News,1977
3. D. S. Johnson, L. A. McGeoch, and E. E. Rothberg, Near-optimal solutions to very large traveling salesman problems, to appear.
4. An efficient heuristic procedure for partitioning graphs;Kernighan;Bell Systems Tech. J.,1972
5. Optimization by simulated annealing;Kirkpatrick;Science,1983
Cited by
413 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献