Search results
From MaRDI portal
- 2014-12-16 Paper Shortest path problem with forbidden paths: the elementary version 2014-07-28 Paper The \(\alpha\)-reliable shortest path problem 2013-12-11...10 bytes (15 words) - 13:08, 8 December 2023
- Publication Type Shortest path algorithms for nearly acyclic directed graphs 2024-06-05 Paper Sub-cubic cost algorithms for the all pairs shortest path problem...10 bytes (13 words) - 11:58, 11 December 2023
- fixed-parameter tractability of the clustered shortest-path tree problem 2019-06-25 Paper Fault-tolerant approximate shortest-path trees 2018-10-18 Paper Polygon-constrained...10 bytes (13 words) - 20:56, 10 December 2023
- number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures 2022-10-13 Paper Shortest paths among transient obstacles 2022-07-18...10 bytes (14 words) - 19:03, 24 September 2023
- 2018-10-30 Paper Two-Point L1 Shortest Path Queries in the Plane 2018-04-23 Paper Planar spanners and approximate shortest path queries among obstacles in...10 bytes (15 words) - 11:23, 28 January 2024
- some shortest path problems 2015-09-02 Paper https://portal.mardi4nfdi.de/entity/Q5501855 2015-08-14 Paper Matrix searching with the shortest path metric...10 bytes (16 words) - 00:27, 9 December 2023
- clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm 2023-12-18 Paper The constrained forward shortest path tour...10 bytes (13 words) - 01:37, 9 December 2023
- 2019-09-11 Paper Shortest Path Feasibility Algorithms: An Experimental Evaluation 2019-09-11 Paper Reach for A*: Efficient Point-to-Point Shortest Path Algorithms...10 bytes (15 words) - 05:41, 12 December 2023
- spanners and approximate shortest path queries among obstacles in the plane 2017-12-05 Paper On-line and dynamic algorithms for shortest path problems 2017-12-04...10 bytes (14 words) - 13:23, 7 December 2023
- of distributed shortest paths on power-law networks in dynamic scenarios 2016-01-28 Paper Path-Fault-Tolerant Approximate Shortest-Path Trees 2016-01-08...10 bytes (13 words) - 02:31, 9 December 2023
- Approximation algorithms for geometric shortest path problems 2014-09-26 Paper Improved Approximation for Time-Dependent Shortest Paths 2014-09-26 Paper Improved algorithms...10 bytes (17 words) - 12:27, 8 December 2023
- Risk-Sensitive Models in Dynamic Programming 2019-08-12 Paper Robust shortest path planning and semicontractive dynamic programming 2019-03-05 Paper An...10 bytes (17 words) - 05:24, 7 October 2023
- Paper Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane 2019-09-11 Paper \(L_{1}\) shortest path queries in simple polygons...10 bytes (13 words) - 08:04, 7 October 2023
- the clustered shortest-path tree problem 2019-06-25 Paper Trainyard is NP-hard 2018-11-23 Paper Fault-tolerant approximate shortest-path trees 2018-10-18...10 bytes (13 words) - 04:37, 7 October 2023
- flow expansion 2022-03-24 Paper An axiomatic approach to time-dependent shortest path oracles 2022-03-22 Paper A linear time algorithm for the arc disjoint...10 bytes (15 words) - 00:05, 11 December 2023
- location on random shortest path metrics 2020-05-12 Paper Probabilistic analysis of optimization problems on generalized random shortest path metrics 2019-10-15...10 bytes (13 words) - 03:13, 7 October 2023
- minmax regret robust shortest path problem in a finite multi-scenario model 2016-04-27 Paper DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS 2015-04-29 Paper...10 bytes (17 words) - 13:15, 10 December 2023
- Highway Dimension and Provably Efficient Shortest Path Algorithms 2018-08-02 Paper On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs...10 bytes (13 words) - 10:28, 7 October 2023
- Routing problem with Restricted L-Path 2018-09-06 Paper Minimum width color spanning annulus 2018-05-15 Paper Geometric path problems with violations 2018-04-06...10 bytes (13 words) - 04:35, 7 October 2023
- down to size 2022-03-01 Paper Multiple-edge-fault-tolerant approximate shortest-path trees 2022-02-01 Paper https://portal.mardi4nfdi.de/entity/Q5002685 2021-07-28...10 bytes (13 words) - 10:14, 11 December 2023
