This thesis studies the 1-center problem on road networks, an important problem in GIS. Using Euclidean embeddings, and reduction to fast nearest neighbor search, an approximation algorithm is devised for this problem. On real world data sets, extensive experiments are conducted that indicate fast computation of constant factor approximate solutions for query sets much larger than previously computable using exact techniques. A web interface was provided for generic queries on a map interface. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Spring Semester, 2012. / March 29, 2012. / Includes bibliographical references. / Piyush Kumar, Professor Directing Thesis; Ashok Srinivasan, Committee Member; Xin Yuan, Committee Member.
| Identifer | oai:union.ndltd.org:fsu.edu/oai:fsu.digital.flvc.org:fsu_183036 |
| Contributors | Neff, Bradley S. (authoraut), Kumar, Piyush (professor directing thesis), Srinivasan, Ashok (committee member), Yuan, Xin (committee member), Department of Computer Science (degree granting department), Florida State University (degree granting institution) |
| Publisher | Florida State University, Florida State University |
| Source Sets | Florida State University |
| Language | English, English |
| Detected Language | English |
| Type | Text, text |
| Format | 1 online resource, computer, application/pdf |
| Rights | This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them. |
Page generated in 0.0022 seconds