Please use this identifier to cite or link to this item:
|Title:||Efficient Approximation Algorithms for the Degree-Restricted Minimum Spanning Tree Problem and the Red-Blue Separation Problem|
|Authors:||Chang, Kevin L.|
|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 firstname.lastname@example.org.|
|Type of Material:||Princeton University Senior Theses|
|Appears in Collections:||Mathematics, 1934-2017|
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.