2314 search results - page 393 / 463 » Minimal Partitions of a Graph |
141
Voted
ICDCS
2011
IEEE
14 years 3 months ago
2011
IEEE
—Resource provisioning for N-tier web applications in Clouds is non-trivial due to at least two reasons. First, there is an inherent optimization conflict between cost of resour...
212
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
148
Voted
ISCA
2005
IEEE
15 years 9 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
206
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
108
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...