| Date of Award | 31 Aug 2013 |
|---|---|
| Original language | English |
| Supervisor | N. Bansal (Supervisor 1) |
Cite this
- Standard
An instance for the Polacek-Svensson algorithm with a quasi-plynomial running time
Student thesis: Master