scientific article; zbMATH DE number 1182917
From MaRDI portal
Publication:4401014
Recommendations
Cited in
(29)- Approximation algorithms for multi-parameter graph optimization problems
- The traveling salesmanpProblem for lines in the plane
- Pasting gauges. I: Shortest paths across a hyperplane
- Shortest paths in reachability graphs
- Shortest shortest path trees of a network
- Flying over a polyhedral terrain
- Computing shortest heterochromatic monotone routes
- Path problems in networks
- Upgrading Shortest Paths in Networks
- Network-Tree Model and Shortest Path Algorithm
- scientific article; zbMATH DE number 4112412 (Why is no real title available?)
- Shortest path problems with node failures
- Constant-factor approximation for TSP with disks
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- On geometric path query problems
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Shortest-path queries in static networks
- scientific article; zbMATH DE number 7093019 (Why is no real title available?)
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Link-Length Minimization in Networks
- Is a straight line the shortest path?
- Maximum thick paths in static and dynamic environments
- Maximal distortion of geodesic diameters in polygonal domains
- Shortest Paths in Graphs of Convex Sets
- Shortest paths for line segments
- The hampered k-Median problem with neighbourhoods
- Path optimization with limited sensing ability
- Shortest paths in networks with vector weights
- Approximate distance oracles for graphs with dense clusters
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401014)
