448 search results - page 32 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
FOCS
2007
IEEE
14 years 17 days ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
NHM
2010
13 years 3 months ago
2010
We study the spatially uniform case of the problem of quasistatic evolution in small strain nonassociative elastoplasticity (Cam-Clay model). Through the introdution of a viscous a...
TON
2008
13 years 8 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...