The Shortcut Problem – Complexity and Approximation (Q3599067): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-540-95891-8_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1505815330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHARC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic multi-level overlay graphs for shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of the Number of Successes in Independent Trials / 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: Experimental algorithms. 7th international workshop, WEA 2008 Provincetown, MA, USA, May 30--June 1, 2008. Proceedings / 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: Speed-Up Techniques for Shortest-Path Computations / rank
 
Normal rank

Latest revision as of 00:22, 29 June 2024

scientific article
Language Label Description Also known as
English
The Shortcut Problem – Complexity and Approximation
scientific article

    Statements

    Identifiers