On the search for geometric orders, centers, and separation

Made available in DSpace on 2022-01-12T21:45:32Z (GMT). No. of bitstreams: 3 JONES-DISSERTATION-2021.pdf: 1914890 bytes, checksum: 366dcc38c4c71d40866af435a7013829 (MD5) LICENSE.txt: 4211 bytes, checksum: e50fd91468e7c0c29de29137ca817c8f (MD5) PROQUEST_LICENSE.txt: 4557 bytes, checksum: b7d874722caa5109ed0d28a53c90906a (MD5) Previous issue date: 2021-07-12

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

2022

Author dc:creator

• Jones, Mitchell Francis

Contributors dc:contributor

• Har-Peled, Sariel
• Chan, Timothy
• Chekuri, Chandra
• Varadarajan, Kasturi

• theoretical computer science
• computational geometry
• approximation algorithms
• randomized algorithms
• centerpoint
• order
• separation
• yolk
• active learning

Statement dc:rights

• Copyright 2021 Mitchell Jones

Language dc:language

en

Handle dc:identifier

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

OAI identifier oai:identifier

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