Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms

Sander Aarts, Jacob Dentes, Manxi Wu, David B. Shmoys. Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms. In Marcin Bienkowski, Matthias Englert, editors, Approximation and Online Algorithms - 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings. Volume 15269 of Lecture Notes in Computer Science, pages 1-15, Springer, 2024. [doi]

Abstract

Abstract is missing.