Author:
Singh Gaurav,Shukla Sandeep K.
Reference23 articles.
1. M. M. Halldorsson. Approximations of Weighted Independent Set and Hereditary Subset Problems. In Proceedings of the 5th Annual International Conference on Computing and Combinatorics, LNCS, pp. 261–270. Springer-Verlag, Heidelberg, Germany, 1999.
2. J. Misra. A Discipline of Multi-Programming. Springer, New York, 2001.
3. J. Blazewicz, J. K. Lenstra, and A. H. G. Rinooy Kan. Scheduling Subject to Resource Constraints: Classification and Complexity. Discrete Applied Mathematics, 5:11–24, 1983.
4. D. Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. In Proceedings of the ACM International Symposium on Theory of Computing (STOC’00), Seattle, WA, USA, pp. 681–690, May 2006.
5. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, Cambridge, 1998.