Prohlížení Publikační činnost ČVUT dle předmětu "computational complexity"
Zobrazují se záznamy 1-2 z 2
-
The Complexity of Fair Division of Indivisible Items with Externalities
(AAAI Press, 2024)We study the computational complexity of fairly allocating a set of indivisible items under externalities. In this recently-proposed setting, in addition to the utility the agent gets from their bundle, they also receive ... -
Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
(Elsevier B.V., 2022)In this paper, we study a distributionally robust parallel machines scheduling problem, minimizing the total flow time criterion. The distribution of uncertain processing times is subject to ambiguity belonging to a set ...