Search Results for author:
Found 2 papers, 0 papers with code
A quest for a fair schedule: The Young Physicists' Tournament
The task of the organizers is to choose the composition of Fights in such a way that each team presents each of its chosen problems exactly once and within a single Fight no problem is presented more than once.
Chore division on a graph
We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
