Selected papers that cite this one
- Sanjeev Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In 37th Annual Symposium on Foundations of Computer Science, pages 2-11, Burlington, Vermont, 14-16 October 1996. IEEE.
- Sanjeev Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In 38th Annual Symposium on Foundations of Computer Science, pages 554-563, Miami Beach, Florida, 20-22 October 1997. IEEE.
- Sanjeev Arora, Alan Frieze, and Haim Kaplan. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In 37th Annual Symposium on Foundations of Computer Science, pages 21-30, Burlington, Vermont, 14-16 October 1996. IEEE.
- Sanjeev Arora, David Karger, and Marek Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 284-293, Las Vegas, Nevada, 29 May-1 June 1995.
- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
- Liming Cai and Jianer Chen. On fixed-parameter tractability and approximability of NP optimization problems. Journal of Computer and System Sciences, 54(3):465-474, June 1997.
- Marc Demange and Vangelis Th. Paschos. On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science, 158(1-2):117-141, 20 May 1996.
- O. Etzioni, S. Hanks, T. Jiang, R. M. Karp, O. Madani, and O. Waarts. Efficient information gathering on the Internet (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 234-243, Burlington, Vermont, 14-16 October 1996. IEEE.
- S. Louis Hakimi, Edward F. Schmeichel, and Neal E. Young. Orienting graphs to optimize reachability. Information Processing Letters, 63(5):229-235, 15 September 1997.
- V. Kann. Polynomially bounded minimization problems that are hard to approximate. Nordic Journal of Computing, 1(3):317-331, Fall 1994.
- Peichen Pan, Weiping Shi, and C. L. Liu. Area minimization for hierarchical floorplans. Algorithmica, 15(6):550-571, June 1996.