3 papers
cs.DS2026
Improved Approximation for Unsplittable CVRP via a Greedy Approach
Daniel Ebert, Leonard Weismantel
We devise a polynomial-time -approximation algorithm for the metric unsplittable Capacitated Vehicle Routing Problem. We build on the Relative Greedy Algorithm suggested by…
cs.GT2026
Nucleolus Computation by Non-Zero-Constrained Optimization
Daniel Ebert, Antonia Ellerbrock
We extend the list of games where the nucleolus is computable in polynomial time. Based on the classical MPS scheme, nucleolus computation can be reduced to the problem of finding…
cs.GT2025
Nucleolus, Happy Nucleolus, and Vehicle Routing
Daniel Ebert, Antonia Ellerbrock
We study the recently introduced fair division concept of the happy nucleolus for cost allocation among players in a cooperative game, with special focus on its computation. The ha…