Author:
Basuchowdhuri Partha,Majumder Subhashis
Publisher
Springer International Publishing
Reference12 articles.
1. Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
3. Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256–278 (1974)
4. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 475–484 (1997)
5. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science, SFCS 1983, pp. 265–273. IEEE Computer Society, Washington, DC (1983)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献