Results 111 to 120 of about 49,625 (158)

Dynamic shortest‐path interdiction

Networks, 2016
We 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 ...
Sefair, Jorge A., Smith, J. Cole
openaire   +1 more source

Shortest Paths with Shortest Detours

Journal of Optimization Theory and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani, Jan Ohst, David Willems, Stefan Ruzika   +3 more
openaire   +1 more source

Shortest paths in euclidean graphs

Algorithmica, 1986
We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are Euclidean distances between points). For many graph models, the average running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is ...
Sedgewick, Robert, Vitter, Jeffrey Scott
openaire   +1 more source

All pairs almost shortest paths

Proceedings of 37th Conference on Foundations of Computer Science, 2000
Summary: Let \(G=(V,E)\) be an unweighted undirected graph on \(n\) vertices. A simple argument shows that computing all distances in \(G\) with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of \textit{D. Aingworth, C. Chekuri, P. Indyk} and \textit{R. Motwani} [SIAM J. Comput. 28, No.
Dor, Dorit, Halperin, Shay, Zwick, Uri
openaire   +2 more sources

Shortest Path Geometric Rounding

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Shortest Paths

2008
Shashi Shekhar, Hui Xiong
  +4 more sources

Shortest Paths

2021
openaire   +2 more sources

Shortest Paths

2011
Sanders, P., Singler, J.
openaire   +2 more sources

Shortest Path Tree Algorithms

The shortest path tree problem is a classical and widely studied combinatorial problem. The scope of this article is to provide an extensive treatment of the major classical approaches. It then proceeds focusing on the auction algorithm and some of its recently developed variants.
openaire   +2 more sources

Shortest Paths

2000
Bernhard Korte, Jens Vygen
openaire   +1 more source