13 search results - page 1 / 3 » Convex Combinations of Single Source Unsplittable Flows |
ESA
2007
Springer
13 years 11 months ago
2007
Springer
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
FOCS
2000
IEEE
13 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
TOC
2008
13 years 4 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
CGF
2011
12 years 8 months ago
2011
We present a novel method to estimate an approximation of the reflectance characteristics of optically thick, homogeneous translucent materials using only a single photograph as ...