The minimum cost flow problem is to determine a least cost shipment of a commodity through a network G = (N, A) in order to satisfy demands at certain nodes from available supplies at other nodes. In ...

Only recently, progress has been made in obtaining o(log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish ...

An algorithm makes it possible to measure the dimensions of a room using just a few microphones and a snap of your fingers. There are many promising applications on the horizon. Blind people sometimes ...

Faster medical breakthroughs? More efficient and personalized healthcare? Better, sturdier manufacturing materials? All of ...

If you want to print something a few inches tall, extruded plastic is a good medium. But when you need something at the nanometer scale, DNA is a better bet — but who has the time to design and ...

SAN FRANCISCO (Reuters) -Google said it has developed a computer algorithm that points the way to practical applications for ...