Algorithmic Foundations of Heuristic Search using Higher-Order Polygon Inequalities

Algorithmic Foundations of Heuristic Search using Higher-Order Polygon Inequalities

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms t...

Full description

Bibliographic Details
Main Author: Campbell, Newton Henry, Jr.
Format: Others
Published: NSUWorks 2016
Subjects:
Computer science
Geometry
Graph Theory
Heuristic Search
Landmarks
Metric Spaces
Navigation
Computer Sciences
Geometry and Topology
Other Computer Sciences
Theory and Algorithms
Online Access:http://nsuworks.nova.edu/gscis_etd/374
http://nsuworks.nova.edu/cgi/viewcontent.cgi?article=1372&context=gscis_etd

Internet

http://nsuworks.nova.edu/gscis_etd/374
http://nsuworks.nova.edu/cgi/viewcontent.cgi?article=1372&context=gscis_etd

Similar Items