Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2004.03.019 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 360 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2004.03.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059940612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast label correcting algorithm for shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-cycle detection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic improvement of the Bellman-Ford algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path algorithms: A computational study with the C programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest‐path methods: Complexity, interrelations and new propositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2004.03.019 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:01, 21 December 2024

scientific article
Language Label Description Also known as
English
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
scientific article

    Statements

    Identifiers