A Simple Algorithm for Dynamic Carpooling with Recourse (arXiv:2411.07553v1)
This research paper presents a simplified algorithm for solving the dynamic carpooling problem, improving upon previous solutions by maintaining low discrepancy in edge orientations with limited recourse as edges are added or removed from a graph.
