We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
We study the power assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two ranges – short and long....
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...