Pages that link to "Item:Q1290636"
From MaRDI portal
The following pages link to An improved approximation ratio for the minimum latency problem (Q1290636):
Displayed 8 items.
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)