205 search results - page 2 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
91
Voted
EUROPAR
2010
Springer
14 years 12 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 ...
101
Voted
COCO
1995
Springer
15 years 3 months ago
1995
Springer
68
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
95
Voted
TALG
2010
14 years 10 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...