Pages that link to "Item:Q490222"
From MaRDI portal
The following pages link to Fast approximation algorithms for routing problems with hop-wise constraints (Q490222):
Displaying 7 items.
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- An improved FPTAS for Restricted Shortest Path. (Q1853085) (← links)
- Direct \(k\)-routing versus cross-docking: worst-case results (Q2037884) (← links)
- An improved FPTAS for mobile agent routing with time constraints (Q2917206) (← links)
- (Q3466550) (← links)
- (Q3680603) (← links)
- Constraint satisfaction, packet routing, and the lovasz local lemma (Q5495839) (← links)