We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. It is known that the GMST problem belongs ...

This is a preview. Log in through your library . Abstract We give new algorithms for simulating a flip of an unbiased coin by flipping a coin of unknown bias. We are interested in efficient algorithms ...

Kyuha Shim designs typography, though you could argue that he doesn’t do it all on his own. The PhD candidate at the Royal College of Art leaves much to algorithms of his own creation. As a researcher ...