Pages that link to "Item:Q5384007"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. (Q5384007):
Displayed 10 items.
- The A priori traveling repairman problem (Q722527) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)