Journal of the ACM Bibliography

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, 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, 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.

• Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs, and nonapproximability -- towards tight results. SIAM Journal on Computing, 27(3):804-915, June 1998.

• 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.

• Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, November 1995.

• Michel X. Goemans and David P. Williamson. .878-approximation algorithms for MAX CUT and MAX 2SAT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 422-431, Montréal, Québec, Canada, 23-25 May 1994.

• Steven Homer and Marcus Peinado. Design and performance of parallel and distributed approximation algorithms for Maxcut. Journal of Parallel and Distributed Computing, 46(1):48-61, 1 October 1997.

• Philip Klein and Hsueh-I Lu. Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 338-347, Philadelphia, Pennsylvania, 22-24 May 1996.

• Guo-Hui Lin and Guoliang Xue. K-center and K-median problems in graded distances. Theoretical Computer Science, 207(1):181-192, 28 October 1998.

• Lung-Tien Liu, Gen-Huey Chen, and Ching-Sung Lu. On the complexity of generating synchronizable test sequences. Journal of Complexity, 8(4):434-450, December 1992.

• Q. S. Wu, K. M. Chao, and R. C. T. Lee. The NPO-completeness of the longest Hamiltonian cycle problem. Information Processing Letters, 65(3):119-123, 13 February 1998.

Shortcuts: