369 search results - page 55 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
COCOON
2001
Springer
15 years 4 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
82
Voted
STOC
2005
ACM
16 years 1 days ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
DISOPT
2008
14 years 11 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
108
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
103
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...