Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Bismuth, Samuel"'
The $n$-way number partitioning problem is a classic problem in combinatorial optimization, with applications to diverse settings such as fair allocation and machine scheduling. All these problems are NP-hard, but various approximation algorithms are
Externí odkaz:
http://arxiv.org/abs/2204.11753
A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. An agent is allowed to share a bounded number of objects between two or more agents in order to attain fairness. The paper studies var
Externí odkaz:
http://arxiv.org/abs/1912.00459
We consider a variant of the $n$-way number partitioning problem, in which some fixed number $s$ of items can be split between two or more bins. We show a two-way polynomial-time reduction between this variant and a second variant, in which the maxim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2f8a7aef4143628ede43f0acb8bddd9
http://arxiv.org/abs/2204.11753
http://arxiv.org/abs/2204.11753