Approximation Algorithms for Network Design and Orienteering

Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-16T16:48:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Korula_Nitish_Source.zip: 227797 bytes, checksum: 09732975f85c1988e787abe3e1a23600 (MD5) Korula_Nitish.pdf: 1461228 bytes, checksum: a89c5c51cd5a80dbf89895640a05f2c1 (MD5)

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2010

Author dc:creator

• Korula, Nitish J.

Contributors dc:contributor

• Chekuri, Chandra S.
• Erickson, Jeff G.
• Har-Peled, Sariel
• Gupta, Anupam

• Algorithms
• Approximation algorithms
• Network design
• Graph algorithms
• Connectivity
• Orienteering

Statement dc:rights

• Copyright 2010 Nitish John Korula. Previous versions of this work have been published in various conferences. Copyright on these versions is held by the respective publishers, (SIAM and Springer-Verlag), but authors retain the rights to use this content in future works such as survey articles, books, theses, etc.

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/16731

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/16731