Dial a Ride from k -forest

DOI10.1145/1721837.1721857zbMath1300.90010OpenAlexW2109721451MaRDI QIDQ2930320

No author found.

Publication date: 18 November 2014

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1721837.1721857

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

Related Items (9)

The Densest $k$-Subhypergraph Problem ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ Algorithms for online car-sharing problem ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Improved approximation algorithms for directed Steiner forest ⋮ On the \(k\)-edge-incident subgraph problem and its variants ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ The online food delivery problem on stars

This page was built for publication: Dial a Ride from k -forest