Author:
Eremeev Anton V.,Kovalenko Yulia V.
Publisher
Springer International Publishing
Reference11 articles.
1. Drozdowski, M.: Scheduling for Parallel Processing, p. 386. Springer, London (2009)
2. Operations Research Proceedings;AV Eremeev,2016
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)
4. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimizations, 2nd edn, p. 362. Springer, Heidelberg (1993)
5. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676–686 (1982)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献