Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
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.
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.