The following pages link to Dial a Ride from <i>k</i> -forest (Q2930320):
Displaying 8 items.
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
