Author:
Hunt Harry B.,Marathe Madhav V.,Stearns Richard E.
Reference48 articles.
1. S. Agarwal and A. Condon, “On approximation algorithms for hierarchical MAX-SAT,” Journal of Algorithms, 26 (1): 141–165, January 1998.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, “Proof verification and hardness of approximation problems,” Journal of the ACM (JACM), 45 (3): 501–555, May 1998.
3. B.S. Baker, “Approximation Algorithms for NP-complete Problems on Planar Graphs,” J. ACM, Vol. 41, No. 1, pp. 153–180, 1994.
4. J.L. Bentley, T. Ottman and P. Widmayer, “The complexity of manipulating hierarchically defined sets of rectangles”, Advances in Computing Research, Vol. 1, F.P. Preparata, ed., JAI Press Inc., pp. 127–158, 1983.
5. E. Cohen and N. Megiddo, “Recognizing Properties of Periodic graphs”, Applied Geometry and Discrete Mathematics, The Victor Klee Festschrift, Vol. 4, P. Gritzmann and B. Strumfels, eds., ACM, New York, pp. 135–146, 1991.