منابع مشابه
Impact of Regionalization and Detour on Ad-hoc Path Choice
Regionalization has been found to impact human route planning, both when the planning is based on a previously learned environment encoded in memory and when maps are used. This paper presents an experiment in a virtual desktop environment and examines how the length of the path in the start region or goal region impacts ad-hoc route choice, i.e., in situations where the decision is made right ...
متن کاملOn the Bottleneck Shortest Path Problem
The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze the complexity of the problem, its relation to the Shortest Path Problem, and the impact of the ...
متن کاملThe tree longest detour problem in a biconnected graph
In a biconnected graph, a detour is the best alternative path from a detour-starting vertex to the destination vertex. A detour-starting vertex is the vertex from which the original shortest path is changed. The longest detour (LD) problem is to find a detour-critical edge in a shortest path such that the removal of the edge results in the maximum distance increment. In this paper, we deal with...
متن کاملBottleneck Bichromatic Plane Matching of Points
Given a set of n red points and n blue points in the plane, we are interested to match the red points with the blue points by straight line segments in such a way that the segments do not cross each other and the length of the longest segment is minimized. In general, this problem in NP-hard. We give exact solutions for some special cases of the input point set.
متن کاملContinuous bottleneck tree partitioning problems
We study continuous partitioning problems on tree network spaces whose edges and nodes are points in Euclidean spaces. A continuous partition of this space into p connected components is a collection of p subtrees, such that no pair of them intersect at more than one point, and their union is the tree space. An edge-partition is a continuous partition de3ned by selecting p − 1 cut points along ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2019
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2019.01.005