Publisher
Springer International Publishing
Reference20 articles.
1. Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25(3), 403–423 (1973)
2. Eremin, I.I., Gimadi, E.K., Kel’manov, A.V., Pyatkin, A.V., Khachai, M.Y.: 2-Approximation algorithm for finding a clique with minimum weight of vertices and edges. Proc. Steklov Inst. Math. 284(suppl. 1), 87–95 (2014).
https://doi.org/10.1134/S0081543814020084
3. Erzin, A.I., Cho, J.D.: Concurrent placement and routing in the design of integrated circuits. Automat. Remote Control 64(12), 1988–1999 (2003).
https://doi.org/10.1023/B:AURC.0000008436.55858.41
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979). Mir, Moscow (1982)
5. Kochetov, Y.A., Panin, A.A., Plyasunov, A.V.: Genetic local search and hardness of approximation for the server load balancing problem. Automat. Remote Control 78(3), 425–434 (2017).
https://doi.org/10.1134/S0005117917030043
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献