EDIT: Note that in all cases, we assume that the symbol occurrences are independent. LZW outperforms Huffman because it doesn't make any such assumption.
Arithmetic coding is patent-encumbered, and a bit harder to implement. The point where arithmetic coding outperforms Huffman coding is when you have very frequent symbols (i.e. less than two bit or so); you can circumvent this if you apply Huffman coding to larger units such as words or tokens (i.e., instead of characters '4','2', have a single integer token "42").
Another thing that's fun to implement is the Burrows-Wheeler transform which is at the heart of bzip2 (and you then need another compressor for the BW-transformed text, but still...)
I haven't penetrated the whole patent mess, but I guess the patents on the basic idea have expired now whereas special techniques to make arithmetic coding faster (i.e., nearly as fast as Huffman coding) are the ones where the patents are still valid because those are younger.
http://en.wikipedia.org/wiki/Arithmetic_coding
EDIT: Note that in all cases, we assume that the symbol occurrences are independent. LZW outperforms Huffman because it doesn't make any such assumption.