Shortest-Path Distances: An Axiomatic Approach
نویسندگان
چکیده
منابع مشابه
An Axiomatic Characterization of the Single-Source Shortest Path Problem
This theory is split into two sections. In the first section, we give a formal proof that a well-known axiomatic characterization of the single-source shortest path problem is correct. Namely, we prove that in a directed graph G = (V,E) with a non-negative cost function on the edges the single-source shortest path function μ : V → R ∪ {∞} is the only function that satisfies a set of four axioms...
متن کاملRethinking Shortest Path: An Energy Expenditure Approach
Considering that humans acting in constrained environments do not always plan according to shortest path criteria; rather, they conceptually measure the path which minimises the amount of expended energy. Hence, virtual characters should be able to execute their paths according to planning methods based not on path length but on the minimisation of actual expended energy. Thus, in this paper, w...
متن کاملA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
This thesis introduces a new acceleration heuristic for shortest path queries, called the PCD algorithm (Precomputed Cluster Distances). PCD precomputes shortest path distances between the partitions of the input graph, which can be obtained by any graph partitioning method. Since the number of partitions can be varied between one and the number of nodes, the method presents an interpolation be...
متن کاملMinimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices. We explore several variations of the problem and give O(1)-approximations for each. We also improve the best known approximation ratio for metric k-median with penalties, as many of our approximations depend upon this b...
متن کاملUnconstrained and Curvature-Constrained Shortest-Path Distances and their Approximation
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results that Bernstein et al. (2000), developed in the context of manifold learning, and those of Karaman and Frazzoli (2011), developed in the context of robotics. We do ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2010
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.1989.tb00874.x