Course: CS270_001: Special Topics in Advanced Computer Science (2009 Winter)

	News forum

1	Neal's section draft of paper on Huffman coding with unequal letter costs PDF document Koufogiannakis and Young on d-approximation for covering file Garg & Konemann on packing and covering PDF document Young on mixed packing and covering PDF document

2	Not available

3	Not available

4	Not available

5	Not available

6	Steve's section I'm interested in the problem of online file caching, which is what I briefly presented in class. This problem has been well-studied for many years (see paper below), but a clever formulation of the problem as a covering LP a few years ago allows it to be solved by the general covering algorithm developed by Christos and Neal (paper below). My more immediate research for a master's degree will be on data structures for dynamic discrete distributions, which is a building block for the pure packing/covering algorithm developed by Christos and Neal. Koufogiannakis and Young on d-approximation for covering file File caching algorithms summary (Young 2002) PDF document