The success of initiatives recently launched to help create more new treatments hinges on bridging the sociological divides that persist in drug discovery and development.

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring.Expand

We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity.We present a deterministic algorithm to find aminimum spanning tree of a graph with <i>n</i> vertices and<i>m</i>.Expand

We give an algorithm that computes a (1 − <i>ε</i>)-approximate maximum weight matching in <iÕ</i>(<i>mε</ i>√< i>n</i>) time, a bound that has resisted improvement despite decades of research.Expand

An (α, β)-spanner of an unweighted graph <i>G</i> is a subgraph <i>H</i> that distorts distances in <i>G</i> up to a multiplicative factor of α and an additive term β. It is well known that any graph… Expand

In this paper, we give a (max, min)-matrix multiplication algorithm running in time O(n(3+ω)/2) in graphs with real capacities assigned to edges/vertices.Expand