We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
Gianluca De Marco, Mauro Leoncini, Manuela Montang...
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...