We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
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 randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...