Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp0179408026s| Title: | Efficient Approximation Algorithms for the Degree-Restricted Minimum Spanning Tree Problem and the Red-Blue Separation Problem |
| Authors: | Chang, Kevin L. |
| Advisors: | Arora, Sanjeev |
| Department: | Mathematics |
| Class Year: | 2001 |
| Extent: | 30 Pages |
| Other Identifiers: | 15151 |
| URI: | http://arks.princeton.edu/ark:/88435/dsp0179408026s |
| 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: | Mathematics, 1934-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.