Author:
Aissi Hassene,Bazgan Cristina,Vanderpooten Daniel
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Aho, A.V., Hopcroft, J.E., Ullmann, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1976)
2. Lecture Notes in Computer Science;H. Aissi,2005
3. Barahona, F., Pulleyblank, R.: Exact arborescences, matching and cycles. Discrete Applied Mathematics 16, 91–99 (1987)
4. Edmonds, J.: System of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards 71, 241–245 (1967)
5. Hong, S.P., Chung, S.J., Park, B.H.: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters 32(3), 233–239 (2004)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献