170 search results - page 11 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
TIP
2010
13 years 2 months ago
2010
Imaging plays an important role in experimental fluid dynamics. It is equally important both for scientific research and a range of industrial applications. It is known, however, t...
SIAMCOMP
1998
13 years 7 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...