Results 231 to 240 of about 26,531 (262)
Some of the next articles are maybe not open access.
Shortest Paths with Shortest Detours
Journal of Optimization Theory and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani +3 more
openaire +1 more source
Information Processing Letters, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Computing shortest paths with uncertainty
Journal of Algorithms, 2003We consider the problem of estimating the length of the shortest path from a vertex s to a vertex t in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, for each edge e, the length of e is known only to lie within an interval [l"e,h"e]; the estimation algorithm can pay w"e to find the exact length
Tomás Feder +4 more
openaire +1 more source
European Journal of Operational Research, 2013
Abstract We study cooperative games that arise from the problem of finding shortest paths from a specified source to all other nodes in a network. Such networks model, among other things, efficient development of a commuter rail system for a growing metropolitan area.
openaire +1 more source
Abstract We study cooperative games that arise from the problem of finding shortest paths from a specified source to all other nodes in a network. Such networks model, among other things, efficient development of a commuter rail system for a growing metropolitan area.
openaire +1 more source
Stochastic shortest paths with recourse
Networks, 1988AbstractThis paper considers Stochastic Shortest Path (SSP) problems in probabilistic networks. A variety of approaches have already been proposed in the literature. However, unlike in the deterministic case, they are related to distinct models, interpretations and applications.
ANDREATTA, GIOVANNI, L. ROMEO
openaire +1 more source
Proceedings of the ACM annual conference on - ACM'72, 1972
In finding shortest paths, the operation of finding, successively, a minimum from a list of numbers may require more work than the remainder of the algorithm. It is shown how algorithms from sorting literature can be used to accomplish this part of the shortest path algorithm.
openaire +1 more source
In finding shortest paths, the operation of finding, successively, a minimum from a list of numbers may require more work than the remainder of the algorithm. It is shown how algorithms from sorting literature can be used to accomplish this part of the shortest path algorithm.
openaire +1 more source
Dynamic shortest‐path interdiction
Networks, 2016We study a dynamic network game between an attacker and a user. The user wishes to find a shortest path between a pair of nodes in a directed network, and the attacker seeks to interdict a subset of arcs to maximize the user's shortest‐path cost. In contrast to most previous studies, the attacker can interdict arcs any time the user reaches a node in ...
Jorge A. Sefair, J. Cole Smith
openaire +1 more source
1986
Recently there has been considerable research activity on algorithms for finding shortest paths in geometries induced by obstacles. A typical problem is finding the shortest path between two points on the Euclidean plane avoiding a given set of polygonal obstacles (see Figure 1). We review this area and isolate several interesting open problems.
openaire +1 more source
Recently there has been considerable research activity on algorithms for finding shortest paths in geometries induced by obstacles. A typical problem is finding the shortest path between two points on the Euclidean plane avoiding a given set of polygonal obstacles (see Figure 1). We review this area and isolate several interesting open problems.
openaire +1 more source
On shortest paths in polyhedral spaces
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984We consider the problem of computing the shortest path between two points in two- or three-dimensional space bounded by polyhedral surfaces. In the two-dimensional case the problem is easily solved in time \(O(n^ 2\log n)\). In the general three-dimensional case the problem is quite hard to solve, and is not even discrete; we present a doubly ...
Micha Sharir, Amir Schorr
openaire +2 more sources
Shortest paths with side sensors
2011 IEEE International Conference on Robotics and Automation, 2011We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field-Of-View (FOV). In this paper we provide a generalization to
SALARIS, PAOLO +2 more
openaire +1 more source