Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp015h73pw482| Title: | Approximating the Sparsest Cut |
| Authors: | Orecchia, Lorenzo |
| Advisors: | Arora, Sanjeev |
| Department: | Computer Science NA |
| Class Year: | 2005 |
| Extent: | 20 Pages |
| Other Identifiers: | 18677 |
| URI: | http://arks.princeton.edu/ark:/88435/dsp015h73pw482 |
| Location : | This thesis can be viewed in person at the Mudd Manuscript Library. To order a copy complete the Senior Thesis Request Form. For more information contact mudd@princeton.edu. |
| Type of Material: | Princeton University Senior Theses |
| Appears in Collections: | Computer Science, 1987-2024 |
Files in This Item:
There are no files associated with this item.
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.