Changes

Strongly polynomial algorithm for directed ''S-T'' edge-connectivity augmentation[[Veghal]]

Let ''D=(V,A)'' be a digraph, and <math>u: V \to {\mathbb Z_+}</math>. When does ''D'' contain ''k'' edge-disjoint directed spanning trees so that in each directed spanning tree the in-degree of ''v'' is at most ''u(v)''?[[Veghal]]

Strongly polynomial algorithm for market equilibrium (see http://www.cc.gatech.edu/fac/Vijay.Vazirani/market.ps )[[Veghal]]