Author:
Basov Ivan,Vainshtein Alek
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. Minimal spanning tree subject to a side constraint;Aggarwal;Comput. Oper. Res.,1982
2. An approximate algorithm for combinatorial optimization problems with two parameters;Blokh;Austral. J. Combin.,1996
3. Combinatorial Optimization;Cook,1998
4. J. Ganley, M. Golin, J. Salowe, The multi-weighted spanning tree problem, in: Computing and Combinatorics, Xi'an, Lecture Notes in Computer Science, Vol. 959, Springer, Berlin, 1995, pp. 141–150.
5. Computers and Intractability: A Guide to the Theory of NP Completeness;Garey,1979
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献