Engineering Route Planning Algorithms (Q3637315): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55924035, #quickstatements; #temporary_batch_1705957399925
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / 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.1007/978-3-642-02094-0_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168148394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Label-Constrained Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Routing in Road Networks with Transit Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum time-dependent travel times with contraction hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHARC / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Dependent SHARC-Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574265 / 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: Planar graphs, negative weight edges, shortest paths, and near linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering multilevel overlay graphs for shortest-path queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining speed-up techniques for shortest-path computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs to speedup Dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Compact Oracles for Approximate Distances in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional A  ∗  Search for Time-Dependent Fast Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient models for timetable information in public transportation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Highway Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra's algorithm on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric containers for efficient shortest-path computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:05, 1 July 2024

scientific article
Language Label Description Also known as
English
Engineering Route Planning Algorithms
scientific article

    Statements

    Engineering Route Planning Algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers