Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference10 articles.
1. Memorandum number UCB/ERL M80/22;D. Gusfield,1980
2. O.H. Ibarra and C.E. Kim, “Fast approximation algorithms for the knapsack and sum of subset problem”,Journal of the Association for Computing Machinery 22 (1975) 463–468.
3. V. Klee and G.J. Minty, “How good is the simplex algorithm?”, in O. Shisha, Ed.,Inequalities III (Academic Press, New York, 1969) pp. 159–175.
4. G. Mathews, “On the partition of numbers”,Proceedings of the London Mathematical Society 28 (1897) 486–490.
5. K. Murty, “Computational complexity of parametric linear programming”,Mathematical Programming 19 (1980) 213–219.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献