Pages that link to "Item:Q5860477"
From MaRDI portal
The following pages link to Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477):
Displaying 6 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. (Q4636540) (← links)
- LATIN 2004: Theoretical Informatics (Q5901662) (← links)
- (Q6124759) (← links)