Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference2 articles.
1. Coffman E. G., Jr., Langston M. A.: A performance guarantee for the greedy set-partitioning algorithm. Acta Inf.,21: 409–415 (1984).
2. Garey M. R., Johnson D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman 1979.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献