Sciweavers

EOR
2008
162views more  EOR 2008»
14 years 29 days ago
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Given arbitrary source and target nodes s, t and an s
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chr&...