Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Universally truthful mechanisms for scheduling
Georgios Anastasiadis, George Christodoulou, Elias Koutsoupias +2
We consider universally truthful randomized mechanisms for the problem of scheduling jobs on unrelated machines. We prove a lower bound on the expected approximation ratio…
cs.CC2026
On the Complexity of the Minimum-()-Shortcut Problem
Tatiana Rocha Avila, Julian Christoph Brinkmann, Alexander Leonhardt +1
We consider the Minimum-- problem (), where the goal is to find the smallest set of shortcut edges such that every ver…