Results 311 to 320 of about 569,188 (376)
Some of the next articles are maybe not open access.
On Bounded Leg Shortest Paths Problems
Algorithmica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roditty, Liam, Segal, Michael
openaire +2 more sources
Unpaired Image-to-Image Translation with Shortest Path Regularization
Computer Vision and Pattern Recognition, 2023Unpaired image-to-image translation aims to learn proper mappings that can map images from one domain to another domain while preserving the content of the input image. However, with large enough capacities, the network can learn to map the inputs to any
Shaoan Xie +3 more
semanticscholar +1 more source
A new algorithm for the shortest‐path problem
Networks, 2018AbstractIn this article we propose a new single‐source shortest‐path algorithm that achieves the same O(n · m) time bound as the Bellman‐Ford‐Moore algorithm but outperforms it and other state‐of‐the‐art algorithms in many cases in practice. Our claims are supported by experimental evidence.
Amr Elmasry, Ahmed Shokry
openaire +2 more sources
A note on k-shortest paths problem
Journal of Graph Theory, 2010Summary: It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices \(s\) and \(t\), then there are two edge-disjoint paths from \(s\) to \(t\) and both of them are shortest paths.
Gravin, Nick, Chen, Ning
openaire +1 more source
On the Shortest Path Problems with Edge Constraints
2020 22nd International Conference on Transparent Optical Networks (ICTON), 2020The goal of this work is to provide a brief classification of some Shortest Path Problem (SPP) variants that include edge constraints and that find applications in several different contexts, including optical networks, transportation and logistics.
Ferone D. +3 more
openaire +2 more sources
The Fixed-Charge Shortest-Path Problem
INFORMS Journal on Computing, 2012Consider a network 𝒩 =(N, A) and associate with each arc e ∈ A a fixed cost ce for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost [Formula: see text] for resource consumed along e.
Engineer, Faramroze G. +3 more
openaire +2 more sources
The shortest path problem with forbidden paths
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Villeneuve, Daniel, Desaulniers, Guy
openaire +3 more sources
A note on the constrained shortest‐path problem
Naval Research Logistics Quarterly, 1984AbstractThe subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest‐path problem.
Pujari, Arun K. +2 more
openaire +1 more source
1970
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +1 more source
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +1 more source
On the difficulty of some shortest path problems
ACM Transactions on Algorithms, 2003We prove superlinear lower bounds for some shortest path problems in directed graphs, where no such bounds were previously known. The central problem in our study is the replacement paths problem: Given a directed graph G with non-negative edge weights, and a shortest path P
John Hershberger +2 more
openaire +1 more source