Pages that link to "Item:Q5116468"
From MaRDI portal
The following pages link to Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468):
Displaying 8 items.
- Shortest paths among transient obstacles (Q2156288) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE (Q3422224) (← links)
- (Q5009492) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE (Q5687652) (← links)
- Removing Connected Obstacles in the Plane is FPT (Q6059988) (← links)