Pages that link to "Item:Q4030352"
From MaRDI portal
The following pages link to SHORTEST PATH QUERIES IN RECTILINEAR WORLDS (Q4030352):
Displaying 12 items.
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- Querying Approximate Shortest Paths in Anisotropic Regions (Q3053153) (← links)
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane (Q4943866) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315) (← links)
- Shortest beer path queries in outerplanar graphs (Q6103523) (← links)
