Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. S. Arora, D. Karger and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 284–293.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. IEEE Foundations of Computer Science, 1992, pp. 14–23.
3. S. Arora and C. Lund, Hardness of approximations, in: Approximation algorithms for NP-hard problems (D. S. Hochbaum, ed.), PWS, Boston, 1995, pp. 399–446.
4. D. Bauer, J. van den Heuvel and E. Schmeichel, Toughness and triangle-free graphs, J. Combin. Theory Ser. B65, (1995), 208–221.
5. J. A. Bondy and V. Chvátal, A method in graph theory, Discrete Math.15 (1976), 111–135.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献