Learn More
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is deened by a dynamic network with several sources and sinks; each source has a speciied supply and each sink has a speciied demand. The problem is to send exactly the right amount of ow out of each source and into each sink in the(More)
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the(More)
Currently existing message logging protocols demonstrate a classic pessimistic vs. optimistic tradeoff. It is shown that the optimistic-pessimistic tradeoff is not inherent to the problem of message logging. The authors construct a message-logging protocol that has the positive features of both optimistic and pessimistic protocols: the protocol prevents(More)
Leadership development practitioners have become increasingly interested in the formation of leadership networks as a way to sustain and strengthen relationships among leaders within and across organizations, communities, and systems. This paper offers a framework for conceptualizing different types of leadership networks and identifies the outcomes that(More)
/ / Currently existing message logging protocols demonstrate a classic pessimistic vs. optimistic tradeoff. We show that the optimistic-pessimistic tradeoff is not inherent to the problem of message logging. We construct a message-logging protocol that has the positive features of both optimistic and pessimistic protocol: our protocol prevents orphans and(More)
  • 1