1. Babu AC, Ramakrishnan PV (1991) New proofs of Konig–Egervary theorem and maximal flow–minimal cut capacity theorem using o.r. techniques. Indian J Pure Appl Math 22(11):905–911
2. Garey MR, Johnson DS (1977) The rectilinear Steiner tree problem is NP complete. SIAM J Appl Math 32:826–834
3. Halperin E (2002) Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J Comput 31(5):1608–1625
4. Hanckowiak M, Karonski M, Panconesi A (1998) On the distributed complexity of computing maximal matchings. In: Proc 9th annual ACM-SIAM symp on discrete algorithms. SIAM, Philadelphia, pp 219–225
5. LNCS;J Kiniwa,2005