| |
| | Approximation Algorithms |
 | | Approximation Algorithms for Bin Packing: A Survey, E. Coffman, Jr., M. Garey, and D. Johnson, Approximation Algorithms for NP-Hard Problems, D. Hochbaum (editor), PWS Publishing, Boston (1997), 46-93. |
 | | Linear Approximation of Shortest Superstrings, by Avrim Blum, Tao Jiang, Ming Li, John Tromp, and Mihalis Yannakakis in STOC'91 and Journal of ACM, 41:4 (1994), 630-647. |
 | | On the approximation of shortest common supersequences and longest common subsequences. |
| www.csd.uwo.ca /~bma/teaching/approx/resources.html (274 words) |
|