1. Location of a tree shaped facility in a network;Aneja;INFOR,1992
2. Proof verification and hardness of approximation problems;Arora;Proc. 33rd IEEE Symp. on Foundations of Computer Science,1992
3. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda,1985
4. Efficient probabilistically checkable proofs: Applications to approximations;Bellare;Proc. 25th ACM Symp. on the Theory of Computing,1993
5. Improved approximations for the Steiner tree problem;Berman;Proc. Third Ann. ACM-SIAM Symp. on Discrete Algorithms,1992