Author:
Lakshmanan K.B.,Rosenkrantz Daniel J.,Ravi S.S.
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. The transitive reduction of a directed graph;Aho;SIAM J. Comput.,1972
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33rd IEEE FOCS, 1992 pp. 14–23.
3. Introduction to Algorithms;Cormen,1990
4. P. Crescenzi, V. Kann, A compendium of NP optimization problems, ftp.nada.kth.se, pub/documents/Theory/Viggo-Kann/compendium.ps, 1995.
5. U. Feige, A threshold of lnn for approximating set cover, Proc. 28th Ann. ACM STOC, Philadelphia, PA, 1996, pp. 314–318.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Model-predictive safety: A new evolution in functional safety;Smart Manufacturing;2020
2. Design for Process Safety – A Perspective;Proceedings of the 8th International Conference on Foundations of Computer-Aided Process Design;2014
3. Identifying Codes and Covering Problems;IEEE Transactions on Information Theory;2008-09
4. Identifying Code for Directed Graph;Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007);2007-07
5. Approximability of identifying codes and locating–dominating codes;Information Processing Letters;2007-06