Author:
Sharifov F. A.,Hulianytskyi L. F.
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. V. A. Trubin, “Two classes of location problems on tree networks,” Cybernetics, 19, No. 4, 539–544 (1983).
2. F. A. Sharifov, “The problem of synthesis of reliable networks,” Cybernetics and Systems Analysis, 36, No. 4, 596–604 (2000).
3. N. Z. Shor and F. A. Sharifov, “The general problem of synthesis of reliable networks,” Problems of Informatics and Cybernetics, Nos. 2–3, 126–131 (2006).
4. F. Barahona, “Network design using cut inequalities,” SIAM J. Optim., 6, No. 3, 823–837 (1996).
5. J. Cheriyan, S. Vempala, and A. Vetta, “An approximation algorithm for minimum cost k-vertex connected subgraph,” SIAM J. Comput., 32, No. 4, 1050–1055 (2003).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献