39 search results - page 3 / 8 » Better approximation algorithms for bin covering |
109
click to vote
APPROX
2000
Springer
15 years 1 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
SIROCCO
2008
14 years 11 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
100
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
SWAT
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...