The following pages link to Dial a Ride from k-Forest (Q3527216):
Displayed 4 items.
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)