Author:
Hunt H. B.,Ravi S. S.,Marathe M. V.,Rosenkrantz D. J.,Radhakrishnan V.,Stearns R. E.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. B.S. Baker, “Approximation Algorithms for NP-complete problems on Planar Graphs,” 24th IEEE Symposium on Foundations of Computer Science (FOCS), 1983, pp 265–273.
2. J.L. Bentley, T. Ottmann and P. Widmayer, “The Complexity of Manipulating Hierarchically Defined set of Intervals,” Advances in Computing Research, ed. F.P. Preparata Vol. 1, (1983), pp. 127–158.
3. A. Condon, J. Feigenbaum, C. Lund and P. Shor, “Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE-Hard Functions”, in Proc. 25th Annual ACM Symposium on Theory Of Computing, (STOC), 1993, pp. 305–313.
4. A. Condon, J. Feigenbaum, C. Lund and P. Shor, “Random Debators and the Hardness of Approximating Stochastic functions for PSPACE-Hard Functions”, to appear in 9th Annual IEEE Annual Conference on Structure in Complexity Theory, June 1994.
5. B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., Vol. 86, 1990, pp. 165–177.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献