national Symposium on Algorithms and Computation, Lecture Notes in.pdf

Bibliography Aarts, E. H. L., and Korst, J. (1989), Simulated Annealing and Boltzmann Ma- chines, John Wiley Sons, New York. Agarwal, P. K., and Procopiuc, C. M. (1998), “Exact and approximation algo- rithms for clustering”, Proc. 9th Annual ACM-SIAM Symposium on Dis- crete Algorithms, ACM-SIAM, 658–667. (ND53) Agarwal, P. K., and Suri, S. (1994), “Surface approximation and geometric par- titions”, Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 34–43. (MS17) Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M., and Thorup, M. (1996), “On the approximability of numerical taxonomy”, Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms , ACM-SIAM, 365–372. (MS18) Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., and Schieber, B. (1997), “The angular-metric traveling salesman problem”, Proc. 8th An- nual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 221– 229. (ND34) Aggarwal, M., and Garg, N. (1994), “A scaling technique for better network design”, Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 233–239. (ND10) Aho, A. V., Hopcroft, J. E., and Ullman, J. D. (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading MA. Akutsu, T., and Halld´orsson, M. (1994), “On the approximation of largest com- mon point sets and largest common subtrees”, Proc. 5th Annual Inter- Bibliography national Symposium on Algorithms and Computation, Lecture Notes in Computer Science 834, Springer-Verlag, Berlin, 405–413. (SR8, SR9) Akutsu, T., and Halld´orsson, M. (1997), “On the approximation of largest com- mon point sets and largest common subtrees”,