536 search results - page 12 / 108 » The hardness and approximation algorithms for l-diversity |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
IPL
1998
14 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
EUROPAR
2010
Springer
14 years 9 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
82
Voted
NETWORKS
2006
14 years 9 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...